How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
The identity relation and the membership relation
Definition
Let be a set. The identity relation and the membership relation on are
sets by The Axiom Schema of Separation: for each formula , applied inside (The Cartesian product ), and relations on in the sense of Relation, , , , and the specialisations "relation from to " and "relation on ". Thus holds if and only if and , and holds if and only if and both lie in (The Kuratowski ordered pair ).
Remarks
-
carries the set with it. and are different relations when , because . That is what makes usable as a neutral element for composition on the left and on the right, with the correct set in each position.
-
The membership relation is the one Foundation constrains. is set membership restricted to , so Under Foundation, for every set , there are no sets with , and there are no sets with says that it has no cycle of length one, two or three.
Depends on
- The Cartesian product $A \times B := \{\, z \in \mathcal{P}(\mathcal{P}(A \cup B)) : \exists a \in A\ \exists b \in B\ z = (a,b) \,\}$
- The Axiom Schema of Separation: for each formula $\varphi$, $\forall \bar p\,\forall x\,\exists y\,\forall z\,(z \in y \leftrightarrow (z \in x \wedge \varphi(z,\bar p)))$
- Relation, $\operatorname{dom} R$, $\operatorname{ran} R$, $\operatorname{fld} R$, and the specialisations "relation from $A$ to $B$" and "relation on $A$"
- The Kuratowski ordered pair $(a,b) := \{\{a\},\{a,b\}\}$
Used by
- For f : A → B with A ≠ ∅: f is injective if and only if there is g : B → A with g ∘ f = Δ_A; for A = ∅ the empty function is injective and has a left inverse if and only if B = ∅ Corollary
- Reflexive, irreflexive, symmetric, asymmetric, antisymmetric, transitive, and connex relations on a set Definition
- For any indexed family the product ∏_i ∈ I P(Xᵢ) contains the constant function with value ∅, and ∏_i ∈ I {i} has exactly one element Example
- FALSE: assuming ZF is consistent, ZF proves that every surjection f : A → B has a right inverse g : B → A with f ∘ g = Δ_B False statement
- If f and g are functions then g ∘ f is a function with domain f⁻¹[dom g] and (g ∘ f)(x) = g(f(x)) there; Δ_A is a function with Δ_A(a) = a; and f ∘ Δ_A = f = Δ_B ∘ f for f : A → B Lemma
- T ∘ (S ∘ R) = (T ∘ S) ∘ R, (S ∘ R)⁻¹ = R⁻¹ ∘ S⁻¹, (R⁻¹)⁻¹ = R, dom(R⁻¹) = ran R, and Δ_B ∘ R = R = R ∘ Δ_A for a relation R from A to B Proposition
- The Axiom of Choice is stated on this page and assumed by no proof on it; the two statements that would need it are identified and left unsettled Remark
- Every function f : A → B factors as f = ι ∘ bar f ∘ π with π : A → A/ker f the surjective quotient map, bar f : A/ker f → f[A] the bijection [a] ↦ f(a), and ι : f[A] → B the inclusion injection; bar f is the only function making the factorisation hold Theorem
- f : A → B is a bijection if and only if there is a function g : B → A with g ∘ f = Δ_A and f ∘ g = Δ_B; such a g is unique, equals the inverse relation f⁻¹, and is itself a bijection Theorem
- On a set A, R ↦ R ∖ Δ_A and S ↦ S ∪ Δ_A are mutually inverse bijections between the partial orders on A and the irreflexive, transitive relations on A; R ∖ Δ_A is the strict order of R, and every irreflexive transitive relation is asymmetric Theorem
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 16 results over 8 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- B. Kaya, MATH 320 Set Theory (METU), Def. 13 and Def. 14 (standard reference, not scraped)
- Binary relation (Wikipedia) (standard reference, not scraped)
- Axiom of regularity (Wikipedia) (standard reference, not scraped)