Exercise 8.1.11

Prove the following distributive laws (see Exercise 3.13 in Chapter 2).

= =

Answers

First we show that

= .

Proof. First let

L = R =

so that we must show that L = R .

(⊆) Consider any x L . For any t T , define the set S t = { s S x A t , s } . Since x L we have that x s S A t , s for all t T . Hence, for all t T , there is an s S such that x A t , s . From this it follows that S t for any t T . Now, by the Axiom of Choice, the system of sets { S t t T } has a choice function g . We then define a function f ( t ) = g ( S t ) for any t T , noting that this is defined for all t T since S t is nonempty. Clearly then we have, for any such t T , that f ( t ) = g ( S t ) S t S so that f ( t ) S . Hence f is a function from T into S so that f S T .

Now consider any specific t T so that f ( t ) S t and hence x A t , f ( t ) by the definition of S t . Thus since t was arbitrary this shows that x t T A t , f ( t ) . Moreover, since f S T we clearly have that x = R . Thus, since x was arbitrary, this shows that L R .

(⊇) Now consider any x R so that there is an f S T such that x t T A t , f ( t ) . Thus we have that x A t , f ( t ) for all t T . So consider any t T and let s = f ( t ) , noting that s = f ( t ) S since f S T . Thus we have that x A t , f ( t ) = A t , s . Since we have shown that there is an s S such that x A t , s , it follows that x s S A t , s . Since t T was arbitrary we have x = L . Hence R L since x was arbitrary. □

Now we show that

= .

Proof. First let

L = R =

so that we must show that L = R .

(⊆) Consider any x L so that there is a t T such that x s S A t , s . Hence we have that x A t , s for all s S . Now consider any f S T . Then we have that f ( t ) S so that x A t , f ( t ) . Therefore there is a t T such that x A t , f ( t ) so that x t T A t , f ( t ) . Moreover, since f was arbitrary, we have that x = R . This shows that L R since x was arbitrary.

(⊇) We show this by contrapositive. So suppose that x L . Hence we have

x ¬ t T ( x s S A t , s ) ¬ t T s S ( x A t , s ) t T s S ( x A t , s ) .

Now, let S t = { s S x A t , s } for each t T , noting that S t by the above for any t T . Then, by the Axiom of Choice, the system of sets { S t t T } has a choice function g . We then set f ( t ) = g ( S t ) for any t T . Then clearly f ( t ) = g ( S t ) S t S for any t T so that f ( t ) S since g is a choice function. It then follows that f is a function from T into S so that f S T . Now consider any t T so that f ( t ) = g ( S t ) S t . Then, by the definition of S t , we have that x A t , f ( t ) . Since t T was arbitrary, we have thus shown that

f S T t T ( x A t , f ( t ) ) ¬ f S T t T ( x A t , f ( t ) ) ¬ f S T ( x t T A t , f ( t ) ) ¬ [ x ] x x R .

Since x was arbitrary, this shows by contrapositive that x R implies x L so that R L . □

User profile picture
2024-07-15 11:42
Comments