Simple theorems in the algebra of sets (original) (raw)
The simple theorems in the algebra of sets are some of the elementary properties of the algebra of union (infix ∪), intersection (infix ∩), and set complement (postfix ') of sets. These properties assume the existence of at least two sets: a given universal set, denoted U, and the empty set, denoted {}. The algebra of sets describes the properties of all possible subsets of U, called the power set of U and denoted P(U). P(U) is assumed closed under union, intersection, and set complement. The algebra of sets is an interpretation or model of Boolean algebra, with union, intersection, set complement, U, and {} interpreting Boolean sum, product, complement, 1, and 0, respectively.
| Property | Value |
|---|---|
| dbo:abstract | The simple theorems in the algebra of sets are some of the elementary properties of the algebra of union (infix ∪), intersection (infix ∩), and set complement (postfix ') of sets. These properties assume the existence of at least two sets: a given universal set, denoted U, and the empty set, denoted {}. The algebra of sets describes the properties of all possible subsets of U, called the power set of U and denoted P(U). P(U) is assumed closed under union, intersection, and set complement. The algebra of sets is an interpretation or model of Boolean algebra, with union, intersection, set complement, U, and {} interpreting Boolean sum, product, complement, 1, and 0, respectively. The properties below are stated without proof, but can be derived from a small number of properties taken as axioms. A "*" follows the algebra of sets interpretation of Huntington's (1904) classic postulate set for Boolean algebra. These properties can be visualized with Venn diagrams. They also follow from the fact that P(U) is a Boolean lattice. The properties followed by "L" interpret the lattice axioms. Elementary discrete mathematics courses sometimes leave students with the impression that the subject matter of set theory is no more than these properties. For more about elementary set theory, see set, set theory, algebra of sets, and naive set theory. For an introduction to set theory at a higher level, see also axiomatic set theory, cardinal number, ordinal number, Cantor–Bernstein–Schroeder theorem, Cantor's diagonal argument, Cantor's first uncountability proof, Cantor's theorem, well-ordering theorem, axiom of choice, and Zorn's lemma. The properties below include a defined binary operation, relative complement, denoted by infix "\". The "relative complement of A in B," denoted B \A, is defined as (A ∪B′)′ and as A′ ∩B. PROPOSITION 1. For any U and any subset A of U: * {}′ = U; * U′ = {}; * A \ {} = A; * {} \ A = {}; * A ∩ {} = {}; * A ∪ {} = A; * * A ∩ U = A; * * A ∪ U = U; * A′ ∪ A = U; * * A′ ∩ A = {}; * * A \ A = {}; * U \ A = A′; * A \ U = {}; * A′′ = A; * A ∩ A = A; * A ∪ A = A. PROPOSITION 2. For any sets A, B, and C: * A ∩ B = B ∩ A; * L * A ∪ B = B ∪ A; * L * A ∪ (A ∩ B) = A; L * A ∩ (A ∪ B) = A; L * (A ∪ B) \ A = B \ A; * A ∩ B = {} if and only if B \ A = B; * (A′ ∪ B)′ ∪ (A′ ∪ B′)′ = A; * (A ∩ B) ∩ C = A ∩ (B ∩ C); L * (A ∪ B) ∪ C = A ∪ (B ∪ C); L * C \ (A ∩ B) = (C \ A) ∪ (C \ B); * C \ (A ∪ B) = (C \ A) ∩ (C \ B); * C \ (B \ A) = (C \ B) ∪(C ∩ A); * (B \ A) ∩ C = (B ∩ C) \ A = B ∩ (C \ A); * (B \ A) ∪ C = (B ∪ C) \ (A \ C). The distributive laws: * A ∩ (B ∪ C) = (A ∩ B) ∪ (A ∩ C); * * A ∪ (B ∩ C) = (A ∪ B) ∩ (A ∪ C). * PROPOSITION 3. Some properties of ⊆: * A ⊆ B if and only if A ∩ B = A; * A ⊆ B if and only if A ∪ B = B; * A ⊆ B if and only if B′ ⊆ A′; * A ⊆ B if and only if A \ B = {}; * A ∩ B ⊆ A ⊆ A ∪ B. (en) |
| dbo:wikiPageID | 343400 (xsd:integer) |
| dbo:wikiPageLength | 5269 (xsd:nonNegativeInteger) |
| dbo:wikiPageRevisionID | 1094485474 (xsd:integer) |
| dbo:wikiPageWikiLink | dbr:Cantor's_first_uncountability_proof dbr:Cantor's_theorem dbr:Power_set dbr:Model_theory dbr:Boolean_lattice dbr:Algebra_of_sets dbr:Algebraic_structure dbc:Operations_on_sets dbr:Relative_complement dbr:Cantor–Bernstein–Schroeder_theorem dbr:Infix dbr:Interpretation_(logic) dbr:Naive_set_theory dbr:Logical_conjunction dbr:Closure_(mathematics) dbr:Empty_set dbr:Axiomatic_set_theory dbr:Lattice_(order) dbr:Cardinal_number dbr:Discrete_mathematics dbr:Logical_disjunction dbr:Mathematical_proof dbr:Postfix_(linguistics) dbr:Intersection_(set_theory) dbr:Zorn's_lemma dbr:Axiom dbr:Axiom_of_choice dbr:Boolean_algebra dbr:Boolean_algebra_(structure) dbr:If_and_only_if dbr:Ordinal_number dbr:Cantor's_diagonal_argument dbr:Set_(mathematics) dbr:Set_theory dbr:Union_(set_theory) dbr:Venn_diagram dbr:Universal_set dbr:Well-ordering_theorem dbr:Subset dbr:Set_complement dbr:Distributive_law dbr:Edward_Huntington dbr:Edward_V._Huntington dbr:Logical_negation |
| dbp:wikiPageUsesTemplate | dbt:Annotated_link |
| dct:subject | dbc:Operations_on_sets |
| rdf:type | yago:WikicatBasicConceptsInSetTheory yago:Abstraction100002137 yago:Cognition100023271 yago:Concept105835747 yago:Content105809192 yago:Idea105833840 yago:PsychologicalFeature100023100 |
| rdfs:comment | The simple theorems in the algebra of sets are some of the elementary properties of the algebra of union (infix ∪), intersection (infix ∩), and set complement (postfix ') of sets. These properties assume the existence of at least two sets: a given universal set, denoted U, and the empty set, denoted {}. The algebra of sets describes the properties of all possible subsets of U, called the power set of U and denoted P(U). P(U) is assumed closed under union, intersection, and set complement. The algebra of sets is an interpretation or model of Boolean algebra, with union, intersection, set complement, U, and {} interpreting Boolean sum, product, complement, 1, and 0, respectively. (en) |
| rdfs:label | Simple theorems in the algebra of sets (en) |
| owl:sameAs | yago-res:Simple theorems in the algebra of sets wikidata:Simple theorems in the algebra of sets dbpedia-fa:Simple theorems in the algebra of sets https://global.dbpedia.org/id/4uoZW |
| prov:wasDerivedFrom | wikipedia-en:Simple_theorems_in_the_algebra_of_sets?oldid=1094485474&ns=0 |
| foaf:isPrimaryTopicOf | wikipedia-en:Simple_theorems_in_the_algebra_of_sets |
| is dbo:wikiPageRedirects of | dbr:Simple_theorems_in_set_theory dbr:Simple_theorems_on_set_theory |
| is dbo:wikiPageWikiLink of | dbr:List_of_mathematical_logic_topics dbr:List_of_set_theory_topics dbr:Outline_of_discrete_mathematics dbr:Outline_of_logic dbr:Outline_of_probability dbr:Simple_theorems_in_set_theory dbr:Simple_theorems_on_set_theory |
| is foaf:primaryTopic of | wikipedia-en:Simple_theorems_in_the_algebra_of_sets |