Processing math: 100%

Description:

A proof that Form 314 implies Form 119

Content:

A proof that Form 314 (For every set X and every permutation π on X there are two reflections ρ and σ on X such that π=ρσ and for every YX if π[Y]=Y then ρ[Y]=Y and σ[Y]=Y.(A reflection is a permutation ϕ such that ϕ2 is the identity.) implies Form 119 (C(0,uniformly orderable with order type of the integers)).

Form 314 (For every set X and every permutation π on X there are two reflections ρ and σ on X such that π=ρσ and for every YX if π[Y]=Y then ρ[Y]=Y and σ[Y]=Y.(A reflection is a permutation ϕ such that ϕ2 is the identity.) implies Form 119 (C(0,uniformly orderable with order type of the integers)).

Assume that B={Ai:iω} is a denumerable set of denumerable sets and f is a function defined on ω such that iω, f(i) is an ordering of Ai with order type that of the integers.  We want to construct a choice function g for B so we may assume that the elements of B are pairwise disjoint.

Let η be the permutation of B defined by η(a)= the immediate successor of a under the ordering f(Ai) where Ai is the unique element of B such that aAi. By Form 314, η is the product of two reflections: η=ϕψ.

Fix an iω and for each permutation β of B, letβ=βAi. Then η=ϕψ and ϕ and ψ are reflections.  We complete the proof by showing that exactly one ofϕ or ψ has exactly one fixed point.  (This fixed point will be g(Ai).)

Since ϕ and ψ are both reflections, ϕ and ψ can both be written as a product of disjoint cycles,ϕ=iI(si,ti) and ψ=jJ(cj,dj). Assume that Ai={,a1,a0,a1,a2,} where the elements are listed in the order determined by the ordering f(Ai).  Then η is the infinite cycleη=(,a1,a0,a1,a2,).  Let r be the smallest positive integer such that for some integer k the transposition(ak,ak+r) is one of the (si,ti) or one of the (cj,dj)

We first show that r=1.  Assume that r>1 and that (ak,ak+r) is one of the (cj,bj).  (The argument is similar if (ak,ak+r) is one of the (si,ti).)  This means that ψ(ak)=ak+r.Since η(ak)=ak+1 (and r1), ϕ(ak+r) must beak+1, hence the transposition (ak+1,ak+r) must be one of the(si,ti).  This contradicts the definition of r.

Assume that (ak,ak+1) is one of the (cj,dj). (The argument is similar if (ak,ak+1) is one of the (si,ti).)  This means that ψ(ak)=ak+1.  Since η(ak)=ak+1 we conclude thatak+1 must be a fixed point of ϕ.  Further, since ψ(ak+1)=ak and η(ak+1)=ak+2 we conclude that ϕ(ak)=ak+2,that is, (ak,ak+2) is one of the (si,ti).  By this last conclusion,ψ(ak+2)=ak.  It follows that ψ(ak1)=ak+2, that is (ak1,ak+2) is one of the (cj,dj). Continuing in this way, we see that for every natural number j, ψ interchanges akj andak+j+1 and ϕ interchanges akj and ak+j+2.  Therefore,ψ has no fixed points and ϕ has exactly one fixed point.

Howard-Rubin number: 124

Type: Proof

Back