Differences between revisions 1 and 3 (spanning 2 versions)
Revision 1 as of 2026-02-05 16:40:41
Size: 1219
Comment: Initial commit
Revision 3 as of 2026-02-06 15:02:45
Size: 2030
Comment: More notes
Deletions are marked like this. Additions are marked like this.
Line 45: Line 45:
''A ⊆ B'' means that ''A'' is a '''subset''' of ''B''. This can be formally expressed as ''∀ a ((a ∈ A) -> (a ∈ B))''. ''A ⊆ B'' means that ''A'' is a '''subset''' of ''B''. ''∀ a ((a ∈ A) -> (a ∈ B))''.
Line 47: Line 47:
This gives a test for set equality: if ''A ⊆ B'' and ''B ⊆ A''. This leads to a test for set equality: if ''A ⊆ B'' and ''B ⊆ A''.
Line 55: Line 55:
=== Complements ===

The '''complement''' of ''A'' contains all elements that are not members of ''A''. This is usually notated as ''A^c^''.

----



== Operations ==

The '''union''' of two sets contains all members of both. ''A ⋃ B = {x | x ∈ A or x ∈ B}''.

The union of all subsets ''A,,i,,'' can be expressed as:

{{attachment:union.svg}}

The '''intersection''' of two sets contains all members that are common between the two. ''A ⋂ B = {x | x ∈ A and x ∈ B}''.

The intersection of all subsets ''A,,i,,'' can be expressed as:

{{attachment:intersection.svg}}

A pair of sets are '''disjoint''' if there is no intersection, i.e., ''A ⋂ B = ∅''.

The '''set difference''' of ''A'' with respect to ''B'' contains all members in ''A'' that are not in ''B''. ''A \ B = {x ∈ A | x ∉ B}''.


Sets

Sets are a collection of members.


Description

A set is a collection of members. Generally, sets are defined and notated like {a,b,c}.

A set can also be defined by a condition. For example, {x ∈ R | x > 0} should be read as the set of all real values greater than 0.

The empty set is notated Ø.

Commonly Used Sets

The commonly re-used notations for basic sets of numbers are:

  • Natural numbers (N)

  • Integers (Z)

  • Rational numbers (Q)

  • Real numbers (R)


Logic

Membership

a ∈ A means a is a member of A. Conversely, a ∉ A means a is not a member of A.

Subsets

A ⊆ B means that A is a subset of B. ∀ a ((a ∈ A) -> (a ∈ B)).

This leads to a test for set equality: if A ⊆ B and B ⊆ A.

If A ⊆ B and A != B, then A is a proper subset of B. This is notated as either A ⊂ B or A ⊊ B.

The reverse relation could be notated as B ⊇ A, B ⊃ A, and so on.

Complements

The complement of A contains all elements that are not members of A. This is usually notated as Ac.


Operations

The union of two sets contains all members of both. A ⋃ B = {x | x ∈ A or x ∈ B}.

The union of all subsets Ai can be expressed as:

union.svg

The intersection of two sets contains all members that are common between the two. A ⋂ B = {x | x ∈ A and x ∈ B}.

The intersection of all subsets Ai can be expressed as:

intersection.svg

A pair of sets are disjoint if there is no intersection, i.e., A ⋂ B = ∅.

The set difference of A with respect to B contains all members in A that are not in B. A \ B = {x ∈ A | x ∉ B}.


CategoryRicottone

Analysis/Sets (last edited 2026-02-23 17:30:13 by DominicRicottone)