Sæt under driften af union, kryds og komplement opfylder forskellige love (identiteter), som er anført i tabel 1.
Tabel: Lov om algebra af mængder
| Idempotente love | (a) A ∪ A = A | (b) A ∩ A = A |
| Associative love | (a) (A ∪ B) ∪ C = A ∪ (B ∪ C) | (b) (A ∩ B) ∩ C = A ∩ (B ∩ C) |
| Kommutative love | (a) A ∪ B = B ∪ A | (b) A ∩ B = B ∩ A |
| Fordelingslove | (a) A ∪ (B ∩ C) = (A ∪ B) ∩ (A ∪ C) | (b) A ∩ (B ∪ C) =(A ∩ B) ∪ (A ∩ C) |
| De Morgans love | (a) (A ∪B)c=Ac∩ Bc | (b) (A ∩B)c=Ac∪ Bc |
| Identitetslove | (a) A ∪ ∅ = A (b) A ∪ U = U | (c) A ∩ U =A (d) A ∩ ∅ = ∅ |
| Supplerende love | (a) A ∪ Ac= U (b) A ∩ Ac= ∅ | (c) Uc= ∅ (d) ∅c= U |
| Involutionsloven | (a) (Ac)c= A |
Tabel 1 viser algebraloven for mængder.
Eksempel 1: Bevis idempotente love:
(a) A ∪ A = A
Løsning:
Since, B ⊂ A ∪ B, therefore A ⊂ A ∪ A Let x ∈ A ∪ A ⇒ x ∈ A or x ∈ A ⇒ x ∈ A ∴ A ∪ A ⊂ A As A ∪ A ⊂ A and A ⊂ A ∪ A ⇒ A =A ∪ A. Hence Proved.
(b) A ∩ A = A
Løsning:
Since, A ∩ B ⊂ B, therefore A ∩ A ⊂ A Let x ∈ A ⇒ x ∈ A and x ∈ A ⇒ x ∈ A ∩ A ∴ A ⊂ A ∩ A As A ∩ A ⊂ A and A ⊂ A ∩ A ⇒ A = A ∩ A. Hence Proved.
Eksempel 2: Bevis associative love:
(a) (A ∪ B) ∪ C = A ∪ (B ∪ C)
Løsning:
Let some x ∈ (A'∪ B) ∪ C ⇒ (x ∈ A or x ∈ B) or x ∈ C ⇒ x ∈ A or x ∈ B or x ∈ C ⇒ x ∈ A or (x ∈ B or x ∈ C) ⇒ x ∈ A or x ∈ B ∪ C ⇒ x ∈ A ∪ (B ∪ C). Similarly, if some x ∈ A ∪ (B ∪ C), then x ∈ (A ∪ B) ∪ C. Thus, any x ∈ A ∪ (B ∪ C) ⇔ x ∈ (A ∪ B) ∪ C. Hence Proved.
(b) (A ∩ B) ∩ C = A ∩ (B ∩ C)
Løsning:
Let some x ∈ A ∩ (B ∩ C) ⇒ x ∈ A and x ∈ B ∩ C ⇒ x ∈ A and (x ∈ B and x ∈ C) ⇒ x ∈ A and x ∈ B and x ∈ C ⇒ (x ∈ A and x ∈ B) and x ∈ C) ⇒ x ∈ A ∩ B and x ∈ C ⇒ x ∈ (A ∩ B) ∩ C. Similarly, if some x ∈ A ∩ (B ∩ C), then x ∈ (A ∩ B) ∩ C Thus, any x ∈ (A ∩ B) ∩ C ⇔ x ∈ A ∩ (B ∩ C). Hence Proved.
Eksempel 3: Bevis kommutative love
(a) A ∪ B = B ∪ A
Løsning:
To Prove A ∪ B = B ∪ A A ∪ B = {x: x ∈ A or x ∈ B} = {x: x ∈ B or x ∈ A} (∵ Order is not preserved in case of sets) A ∪ B = B ∪ A. Hence Proved. (b) A ∩ B = B ∩ A
Løsning:
To Prove A ∩ B = B ∩ A A ∩ B = {x: x ∈ A and x ∈ B} = {x: x ∈ B and x ∈ A} (∵ Order is not preserved in case of sets) A ∩ B = B ∩ A. Hence Proved. Eksempel 4: Bevis fordelingslove
(a) A ∪ (B ∩ C) = (A ∪ B) ∩ (A ∪ C)
Løsning:
To Prove Let x ∈ A ∪ (B ∩ C) ⇒ x ∈ A or x ∈ B ∩ C ⇒ (x ∈ A or x ∈ A) or (x ∈ B and x ∈ C) ⇒ (x ∈ A or x ∈ B) and (x ∈ A or x ∈ C) ⇒ x ∈ A ∪ B and x ∈ A ∪ C ⇒ x ∈ (A ∪ B) ∩ (A ∪ C) Therefore, A ∪ (B ∩ C) ⊂ (A ∪ B) ∩ (A ∪ C)............(i) Again, Let y ∈ (A ∪ B) ∩ (A ∪ C) ⇒ y ∈ A ∪ B and y ∈ A ∪ C ⇒ (y ∈ A or y ∈ B) and (y ∈ A or y ∈ C) ⇒ (y ∈ A and y ∈ A) or (y ∈ B and y ∈ C) ⇒ y ∈ A or y ∈ B ∩ C ⇒ y ∈ A ∪ (B ∩ C) Therefore, (A ∪ B) ∩ (A ∪ C) ⊂ A ∪ (B ∩ C)............(ii) Combining (i) and (ii), we get A ∪ (B ∩ C) = (A ∪ B) ∩ (A ∪ C). Hence Proved
(b) A ∩ (B ∪ C) = (A ∩ B) ∪ (A ∩ C)
Løsning:
To Prove Let x ∈ A ∩ (B ∪ C) ⇒ x ∈ A and x ∈ B ∪ C ⇒ (x ∈ A and x ∈ A) and (x ∈ B or x ∈ C) ⇒ (x ∈ A and x ∈ B) or (x ∈ A and x ∈ C) ⇒ x ∈ A ∩ B or x ∈ A ∩ C ⇒ x ∈ (A ∩ B) ∪ (A ∪ C) Therefore, A ∩ (B ∪ C) ⊂ (A ∩ B) ∪ (A ∪ C)............ (i) Again, Let y ∈ (A ∩ B) ∪ (A ∪ C) ⇒ y ∈ A ∩ B or y ∈ A ∩ C ⇒ (y ∈ A and y ∈ B) or (y ∈ A and y ∈ C) ⇒ (y ∈ A or y ∈ A) and (y ∈ B or y ∈ C) ⇒ y ∈ A and y ∈ B ∪ C ⇒ y ∈ A ∩ (B ∪ C) Therefore, (A ∩ B) ∪ (A ∪ C) ⊂ A ∩ (B ∪ C)............ (ii) Combining (i) and (ii), we get A ∩ (B ∪ C) = (A ∩ B) ∪ (A ∪ C). Hence Proved
Eksempel 5: Bevis De Morgans love
(a) (A ∪B)<sup>c</sup>=A<sup>c</sup>∩ B<sup>c</sup>
Løsning:
To Prove (A ∪B)<sup>c</sup>=A<sup>c</sup>∩ B<sup>c</sup> Let x ∈ (A ∪B)<sup>c</sup> ⇒ x ∉ A ∪ B (∵ a ∈ A ⇔ a ∉ A<sup>c</sup>) ⇒ x ∉ A and x ∉ B ⇒ x ∉ A<sup>c</sup> and x ∉ B<sup>c</sup> ⇒ x ∉ A<sup>c</sup>∩ B<sup>c</sup> Therefore, (A ∪B)<sup>c</sup> ⊂ A<sup>c</sup>∩ B<sup>c</sup>............. (i) Again, let x ∈ A<sup>c</sup>∩ B<sup>c</sup> ⇒ x ∈ A<sup>c</sup> and x ∈ B<sup>c</sup> ⇒ x ∉ A and x ∉ B ⇒ x ∉ A ∪ B ⇒ x ∈ (A ∪B)<sup>c</sup> Therefore, A<sup>c</sup>∩ B<sup>c</sup> ⊂ (A ∪B)<sup>c</sup>............. (ii) Combining (i) and (ii), we get A<sup>c</sup>∩ B<sup>c</sup> =(A ∪B)<sup>c</sup>. Hence Proved.
(b) (A ∩B)<sup>c</sup> = A<sup>c</sup>∪ B<sup>c</sup>
Løsning:
Let x ∈ (A ∩B)<sup>c</sup> ⇒ x ∉ A ∩ B (∵ a ∈ A ⇔ a ∉ A<sup>c</sup>) ⇒ x ∉ A or x ∉ B ⇒ x ∈ A<sup>c</sup> and x ∈ B<sup>c</sup> ⇒ x ∈ A<sup>c</sup>∪ B<sup>c</sup> ∴ (A ∩B)<sup>c</sup>⊂ (A ∪B)<sup>c</sup>.................. (i) Again, Let x ∈ A<sup>c</sup>∪ B<sup>c</sup> ⇒ x ∈ A<sup>c</sup> or x ∈ B<sup>c</sup> ⇒ x ∉ A or x ∉ B ⇒ x ∉ A ∩ B ⇒ x ∈ (A ∩B)<sup>c</sup> ∴ A<sup>c</sup>∪ B<sup>c</sup>⊂ (A ∩B)<sup>c</sup>.................... (ii) Combining (i) and (ii), we get(A ∩B)<sup>c</sup>=A<sup>c</sup>∪ B<sup>c</sup>. Hence Proved.
Eksempel 6: Bevis identitetslove.
(a) A ∪ ∅ = A
Løsning:
To Prove A ∪ ∅ = A Let x ∈ A ∪ ∅ ⇒ x ∈ A or x ∈ ∅ ⇒ x ∈ A (∵x ∈ ∅, as ∅ is the null set ) Therefore, x ∈ A ∪ ∅ ⇒ x ∈ A Hence, A ∪ ∅ ⊂ A. We know that A ⊂ A ∪ B for any set B. But for B = ∅, we have A ⊂ A ∪ ∅ From above, A ⊂ A ∪ ∅ , A ∪ ∅ ⊂ A ⇒ A = A ∪ ∅. Hence Proved.
(b) A ∩ ∅ = ∅
Løsning:
To Prove A ∩ ∅ = ∅ If x ∈ A, then x ∉ ∅ (∵∅ is a null set) Therefore, x ∈ A, x ∉ ∅ ⇒ A ∩ ∅ = ∅. Hence Proved.
(c) A ∪ U = U
Løsning:
To Prove A ∪ U = U Every set is a subset of a universal set. ∴ A ∪ U ⊆ U Also, U ⊆ A ∪ U Therefore, A ∪ U = U. Hence Proved.
(d) A ∩ U = A
Løsning:
To Prove A ∩ U = A We know A ∩ U ⊂ A................. (i) So we have to show that A ⊂ A ∩ U Let x ∈ A ⇒ x ∈ A and x ∈ U (∵ A ⊂ U so x ∈ A ⇒ x ∈ U ) ∴ x ∈ A ⇒ x ∈ A ∩ U ∴ A ⊂ A ∩ U................. (ii) From (i) and (ii), we get A ∩ U = A. Hence Proved.
Eksempel 7: Bevis komplementlove
(a) A ∪ A<sup>c</sup>= U
Løsning:
To Prove A ∪ A<sup>c</sup>= U Every set is a subset of U ∴ A ∪ A<sup>c</sup> ⊂ U.................. (i) We have to show that U ⊆ A ∪ A<sup>c</sup> Let x ∈ U ⇒ x ∈ A or x ∉ A ⇒ x ∈ A or x ∈ A<sup>c</sup> ⇒ x ∈ A ∪ A<sup>c</sup> ∴ U ⊆ A ∪ A<sup>c</sup>................... (ii) From (i) and (ii), we get A ∪ A<sup>c</sup>= U. Hence Proved.
(b) A ∩ A<sup>c</sup>=∅
Løsning:
As ∅ is the subset of every set ∴ ∅ ⊆ A ∩ A<sup>c</sup>..................... (i) We have to show that A ∩ A<sup>c</sup> ⊆ ∅ Let x ∈ A ∩ A<sup>c</sup> ⇒ x ∈ A and x ∈ A<sup>c</sup> ⇒ x ∈ A and x ∉ A ⇒ x ∈ ∅ ∴ A ∩ A<sup>c</sup> ⊂∅..................... (ii) From (i) and (ii), we get A∩ A<sup>c</sup>=∅. Hence Proved.
(c) U<sup>c</sup>= ∅
Løsning:
Let x ∈ U<sup>c</sup> ⇔ x ∉ U ⇔ x ∈ ∅ ∴ U<sup>c</sup>= ∅. Hence Proved. (As U is the Universal Set).
(d) ∅<sup>c</sup> = U
Løsning:
Let x ∈ ∅<sup>c</sup> ⇔ x ∉ ∅ ⇔ x ∈ U (As ∅ is an empty set) ∴ ∅<sup>c</sup> = U. Hence Proved.
Eksempel 8: Bevis involutionsloven
(a) (A<sup>c</sup> )<sup>c</sup> A.
Løsning:
Let x ∈ (A<sup>c</sup> )<sup>c</sup> ⇔ x ∉ A<sup>c</sup>⇔ x ∈ a ∴ (A<sup>c</sup> )<sup>c</sup> =A. Hence Proved.
Dualitet:
Den dobbelte E∗ af E er ligningen opnået ved at erstatte hver forekomst af ∪, ∩, U og ∅ i E med henholdsvis ∩, ∪, ∅ og U. For eksempel den dobbelte af
(U ∩ A) ∪ (B ∩ A) = A is (∅ ∪ A) ∩ (B ∪ A) = A
Det bemærkes som princippet om dualitet, at hvis en ligning E er en identitet, så er dens duale E∗ også en identitet.
Udvidelsesprincip:
Ifølge princippet om forlængelse er to sæt, A og B de samme, hvis og kun hvis de har de samme medlemmer. Vi betegner lige mængder med A=B.
If A= {1, 3, 5} and B= {3, 1, 5}, then A=B i.e., A and B are equal sets. If A= {1, 4, 7} and B= {5, 4, 8}, then A≠ B i.e.., A and B are unequal sets. Kartesisk produkt af to sæt:
Det kartesiske produkt af to sæt P og Q i den rækkefølge er mængden af alle ordnede par, hvis første medlem tilhører mængden P og andet medlem tilhører mængden Q og er angivet med P x Q, dvs.
parallel bearbejdning
P x Q = {(x, y): x ∈ P, y ∈ Q}. Eksempel: Lad P = {a, b, c} og Q = {k, l, m, n}. Bestem det kartesiske produkt af P og Q.
Løsning: Det kartesiske produkt af P og Q er
