lacunary - Mathnotes

Set Theory

Definition: Set (also: collection, family) \@{set}

A set is a collection of objects, considered as a whole.

Referenced by (31 direct, 497 transitive)

Direct references:

Transitive (depth 1):

Transitive (depth 2):

Transitive (depth 3):

Transitive (depth 4):

Transitive (depth 5):

Transitive (depth 6):

Transitive (depth 7):

Transitive (depth 8):

Transitive (depth 9):

Transitive (depth 10):

Definition: Element (also: member, point) \@{element}

The objects that make up a set are called its elements or its members.

Referenced by (11 direct, 394 transitive)

Direct references:

Transitive (depth 1):

Transitive (depth 2):

Transitive (depth 3):

Transitive (depth 4):

Definition: Membership criterion \@{membership-criterion}

The membership criterion for a set X is a statement of the form x∈X⟺P(x), where P(x) is a proposition that is true for precisely for those objects x that are elements of X, and no others.

Axiom: Axiom of Extensionality \@{axiom-of-extensionality}

Two sets are equal if and only if they have the same elements. Formally, for any sets A and B:

A=B⟺(∀x)(x∈A⟺x∈B)

Referenced by (1 direct)

Direct references:

Definition: superset \@{superset}

If X and Y are sets such that every element of Y is also an element of X, then we say X is a superset of Y, denoted as X⊃Y. This is the same as Y⊂X.

Definition: Union \@{union}

TODO

Definition: Intersection \@{intersection}

TODO

Referenced by (1 direct)

Direct references:

Definition: Empty Set \@{empty-set}

TODO

Theorem \@{set-equality-via-subset-inclusion}

Two sets X and Y are equal if and only if X is a subset of Y and Y is a subset of X.

Proof \@{proof-of-set-equality-via-subset-inclusion}

Suppose X and Y are sets with X⊂Y and Y⊂X. Now, suppose x∈X. Then, x∈Y. Conversely, suppose y∈Y. Then y∈X. Thus, (∀x)(x∈X⟺x∈Y), and X=Y.

◻
Definition: Function (also: mapping) \@{function}

Consider two sets, A and B, whose elements may be any objects whatsoever, and suppose that with each element x of A there is associated, in some manner, any element of B, which we denote by f(x). Then f is said to be a function from A to B.

Referenced by (40 direct, 291 transitive)

Direct references:

Transitive (depth 1):

Transitive (depth 2):

Transitive (depth 3):

Definition: Domain of Definition \@{domain-of-definition}

If f is a function from the set A to the set B, the set A is called the domain of f.

Referenced by (11 direct, 123 transitive)

Direct references:

Transitive (depth 1):

Transitive (depth 2):

Transitive (depth 3):

Transitive (depth 4):

Transitive (depth 5):

Definition: Value \@{value}

If f is a function from the set A to the set B, the elements f(x)∈B are called the values of f.

Referenced by (3 direct, 86 transitive)

Direct references:

Transitive (depth 1):

Transitive (depth 2):

Transitive (depth 3):

Transitive (depth 4):

Definition: Range \@{range}

The set of all values of a function f is called the range of f.

Referenced by (3 direct, 5 transitive)

Direct references:

Transitive (depth 1):

Transitive (depth 2):

Definition: Sequence \@{sequence}

A sequence is a function f defined on the set J of all positive integers.

Referenced by (55 direct, 38 transitive)

Direct references:

Transitive (depth 1):

Transitive (depth 2):

Note \@{sequence-notation}

If f(n)=xn, for n∈J, it is customary to denote the sequence f by the symbol {xn}, or sometimes by x1,x2,x3,….

Definition: Term \@{term}

If f is a sequence denoted as {xn}, the values of f, that is, the elements xn, are called the terms of the sequence.

Note \@{sequence-terms-not-distinct}

The terms of a sequence need not be distinct.

Definition: Inverse Image (also: pre-image, preimage) \@{inverse-image}

If f:A→B and E⊂(B), then f−1(E) denotes the set of all x∈A such that f(x)∈E. We call f−1(E) the inverse image of E under f.

Referenced by (2 direct, 1 transitive)

Direct references:

Transitive (depth 1):

De Morgan's Laws

Theorem \@{complement-of-union-is-intersection-of-complements}

The complement of a union is equal to the intersection of complements.

Proof \@{proof-of-complement-of-union-is-intersection-of-complements}

Let A and B be sets. We want to show that

(A∪B)c=Ac∩Bc.

Suppose x∈(A∪B)c. Then, if x∈A or x∈B, then x∈A∪B and x∉(A∪B)c, a contradiction. Therefore, x∉A and x∉B. That is, x∈Ac and x∈Bc, therefore x∈Ac∩Bc.

◻
Referenced by (2 direct)

Direct references:

Theorem \@{complement-of-intersection-is-union-of-complements}

The complement of an intersection is equal to the union of complements.

Proof \@{proof-of-complement-of-intersection-is-union-of-complements}

Let A and B be sets. We want to show that

(A∩B)c=Ac∪Bc.

Suppose x∈(A∩B)c. Then, x is not in A∩B, that is, x is either not in A or it is not in B or it is in neither. If x is not in A, then it is in Ac, and therefore it is in Ac∪Bc. The same approach works with B, and therefore x∈Ac∪Bc, and we have shown (A∩B)c=Ac∪Bc.

◻