Jump to content

Back-and-forth method

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Michael Hardy (talk | contribs) at 00:15, 13 June 2005 (New article.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

In mathematical logic, especially set theory and model theory, Cantor's back-and-forth method, named after Georg Cantor, is a method for showing isomorphism between countably infinite structures satisfying specified conditions. In particular:

  • Cantor used it to prove that any two countably infinite densely ordered sets (i.e., linearly ordered in such a way that between any two members there is another) without endpoints are isomorphic. An isomorphism between linear orders is simply a strictly increasing bijection. This means, for example, that there exists a strictly increasing bijection between the set of all rational numbers and the set of all real algebraic numbers.
  • It can be used to prove that any two countably infinite atomless Boolean algebras are isomorphic to each other.

Application to densely ordered sets

Suppose that

  • (A, ≤A) and (B, ≤B) are linearly ordered sets;
  • Neither A nor B has either a maximum or a minimum;
  • They are densely ordered, i.e. between any two members there is another;
  • They are countably infinite.

Fix enumerations (without repetition) of the underlying sets:

Now we construct a one-to-one correspondence between A and B that is strictly increasing. Initially no member of A is paired with any member of B.

(1) Let i be the smallest index such that ai is not yet paired with any member of B. Let j be the smallest index such that bj is not yet paired with any member of A and ai can be paired with bj consistently with the requirement that the pairing be strictly increasing. Pair ai with bj.
(2) Let j be the smallest index such that bj is not yet paired with any member of A. Let i be the smallest index such that ai is not yet paired with any member of B and bj can be paired with ai consistently with the requirement that the pairing be strictly increasing. Pair bj with ai.
(3) Go back to step (1).

[Could someone add a reference to the original paper here?]