Sets and Functions : The symmetric difference of two sets.

The symmetric difference of two sets and , denoted by , is defined by ; it is thus the union of their differences in opposite orders. Show that A ∩ (B Δ C) = (A ∩ B) Δ (A ∩ C).

The Symmetric Difference of two Sets: A ring of sets is a non-empty class A of sets such that if A and B are in A, then A Δ B and A ∩B are also in A. Show that A must also contain the empty set.

Topology Sets and Functions (XIV) The Algebra of Sets Ring of Sets The Symmetric Difference of two Sets A ring of sets is a n ...continues

The Symmetric Difference of two Sets: A ring of sets is a non-empty class A of sets such that if A and B are in A, then A Δ B and A∩B are also in A. Show that A must also contain the A - B.

Topology Sets and Functions (XV) The Algebra of Sets Ring of Sets The Symmetric Difference of two Sets A ring of sets is a non-empty class A of sets ...continues

The Symmetric Difference of two Sets: A ring of sets is a non-empty class A of sets such that if A and B are in A, then A Δ B and A∩B are also in A. Show that A must also contain the AUB.

A ring of sets is a non-empty class A of sets such that if A and B are in A, then A Δ B and A∩B are also in A. Show that A must also contain the AUB.

Sets and Functions (XVII): Show that if a non-empty class of sets contains the union and difference of any pair of its sets, then it is a ring of sets.

Show that if a non-empty class of sets contains the union and difference of any pair of its sets, then it is a ring of sets.

Sets and Functions (XVII): Show that a Boolean algebra of sets is a ring of sets.

Show that a Boolean algebra of sets is a ring of sets.

Sets and Functions (XIX): Show that the class of all finite subsets ( including the empty set) of an infinite set is a ring of sets but is not a Boolean algebra of sets.

Show that the class of all finite subsets ( including the empty set) of an infinite set is a ring of sets but is not a Boolean algebra of sets.

Sets and Functions

Show that the class of all finite unions of closed-open intervals on the real line is a ring of sets but is not a Boolean algebra of sets.

Sets and Functions

Show that the class of all finite unions of closed-open intervals on the real line is a ring of sets but is not a Boolean algebra of sets.

Sets and Functions (XXI): Assuming that the universal set U is non-empty, show that Boolean algebras of sets can be described as rings of sets which contain U.

Show that if a non-empty class of sets contains the union and difference of any pair of its sets, then it is a ring of sets.