# intercession

The intercession is an alternative measure for infinite sets^{} of finite numbers.

Definition: Two infinite sets, *A* and *B*, *intercede* (each other) if they can be put in an *intercession*, i.e., if they can be ordered such that *A* is dense in *B* and *B* is dense in *A*. In other words, between two elements of *A* there is at least one element of *B* and, *vice versa*, between two elements of *B* there is at least one element of *A*.

The intercession of sets with nonempty intersection^{}, e.g., the intercession of a set with itself, requires distinction of identical elements. As an example an intercession of the set of positive integers and the set of even positive integers, 1, 2, 3, … and 2’, 4’, 6’, …, is given by 1, 2’, 2, 4’, 3, 6’, ….

The intercession includes Cantor’s definition of equivalent^{} (or equipotent) sets by one-to-one correspondence (or bijection): Two equivalent sets always intercede each other, i.e., they can always be put in an intercession. The intercession is an equivalence relation. All infinite sets of finite numbers (like the integers, the rationals or the reals) belong, under this relation^{}, to the same equivalence class^{}.

Literature W. Mückenheim: Die Mathematik des Unendlichen, Shaker, Aachen 2006.

Title | intercession |
---|---|

Canonical name | Intercession |

Date of creation | 2013-03-22 17:02:23 |

Last modified on | 2013-03-22 17:02:23 |

Owner | WM (16977) |

Last modified by | WM (16977) |

Numerical id | 10 |

Author | WM (16977) |

Entry type | Definition |

Classification | msc 03E10 |

Classification | msc 03E70 |

Synonym | intercede |