Cratylus
Junior Member
- Joined
- Aug 14, 2020
- Messages
- 82
Theorem
Let A and B be. fully ordered classes. Let (L U)be a partition of A
Prove that(L,U) is a cut of A iff ∀x∈L. and ∀y∈U,x <y.
Since (L,U ) is a cut of A ,I know that L ∩ U=∅
But also (L U) is a partition of A ,so could I write it L ∩ U=∅ ?
or should it be written differently maybe [MATH] L_x \cap U_y = \emptyset ; x\ne y [/MATH] ?
Other than this I can do the proof
Let A and B be. fully ordered classes. Let (L U)be a partition of A
Prove that(L,U) is a cut of A iff ∀x∈L. and ∀y∈U,x <y.
Since (L,U ) is a cut of A ,I know that L ∩ U=∅
But also (L U) is a partition of A ,so could I write it L ∩ U=∅ ?
or should it be written differently maybe [MATH] L_x \cap U_y = \emptyset ; x\ne y [/MATH] ?
Other than this I can do the proof