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.
Every function factors as with the surjective quotient map, the bijection , and the inclusion injection; is the only function making the factorisation hold
Statement
Let , write for and let be the quotient map. Put , the identity relation on . Then
- (i) is surjective;
- (ii) there is a function with for every , and it is a bijection;
- (iii) is an injective function with ;
- (iv) ;
- (v) is the only function satisfying (iv).
Facts & Assumptions
Given: a function , with denoting .
is a set, is a relation on , and is an equivalence relation on (For a function the relation is an equivalence relation on ).
there is a function with if and only if whenever (Let be an equivalence relation on with quotient map , and let . There is a function with if and only if implies ; and such a is then unique).
when such a exists it is unique, and it satisfies for every (Let be an equivalence relation on with quotient map , and let . There is a function with if and only if implies ; and such a is then unique).
is injective (one-to-one) if implies , for all (Injection, surjection, bijection).
is surjective (onto) if for every there is some with (Injection, surjection, bijection).
We write , and say is a function from to , when is a function with and (A function is a relation with and implying ; , the value , domain and codomain).
holds if and only if for some (The image and the preimage of a set under a relation).
is a function with and for every (If and are functions then is a function with domain and there; is a function with ; and for ).
is a function, , and for every in that domain (If and are functions then is a function with domain and there; is a function with ; and for ).
if and only if and for every (Functions and are equal if and only if and for every in that common domain).
holds if and only if and (The identity relation and the membership relation ).
means that every element of is an element of (Subset , proper subset , and the separation notation ).
Proof
is an equivalence relation on and says exactly ; so the hypothesis of the universal property is satisfied, and clause (i) is the surjectivity already recorded for the quotient map.
Claim (iii): is a function with domain and ; its range is , which is contained in because every element of is a value of and . It is injective, since reads .
Claim (ii): the universal property gives a function with and for every . Every value of is therefore a value of , so , and the same set is a function ; call it . It is onto , because each element of is for some ; and it is injective, because gives , that is , and therefore . Hence is a bijection.
Claim (iv): is unambiguous by associativity, it is a function with domain , and for its value is ; so it equals .
Claim (v): if also satisfies , then for choose with and compute ; both have domain , so .
Claims (i) to (v) are established, which is the statement.
Depends on
- For a function $f : A \to B$ the relation $\ker f := \{\,(a,a') \in A \times A : f(a) = f(a')\,\}$ is an equivalence relation on $A$
- Let $\sim$ be an equivalence relation on $A$ with quotient map $\pi : A \to A/{\sim}$, and let $f : A \to B$. There is a function $g : A/{\sim} \to B$ with $g \circ \pi = f$ if and only if $a \sim a'$ implies $f(a) = f(a')$; and such a $g$ is then unique
- Equivalence relation, equivalence class, and the quotient set $A/{\sim}$
- The equivalence classes of an equivalence relation are nonempty, cover $A$, and are pairwise equal or disjoint; conversely every such cover arises from exactly one equivalence relation
- Injection, surjection, bijection
- A function is a relation $f$ with $(a,b) \in f$ and $(a,c) \in f$ implying $b = c$; $f : A \to B$, the value $f(a)$, domain and codomain
- The image $R[A]$ and the preimage $R^{-1}[B]$ of a set under a relation
- If $f$ and $g$ are functions then $g \circ f$ is a function with domain $f^{-1}[\operatorname{dom} g]$ and $(g \circ f)(x) = g(f(x))$ there; $\Delta_A$ is a function with $\Delta_A(a) = a$; and $f \circ \Delta_A = f = \Delta_B \circ f$ for $f : A \to B$
- Functions $f$ and $g$ are equal if and only if $\operatorname{dom} f = \operatorname{dom} g$ and $f(x) = g(x)$ for every $x$ in that common domain
- Relation, $\operatorname{dom} R$, $\operatorname{ran} R$, $\operatorname{fld} R$, and the specialisations "relation from $A$ to $B$" and "relation on $A$"
- The identity relation $\Delta_A = \{\,(a,b) \in A \times A : a = b\,\}$ and the membership relation $\in_A\, = \{\,(a,b) \in A \times A : a \in b\,\}$
- $T \circ (S \circ R) = (T \circ S) \circ R$, $(S \circ R)^{-1} = R^{-1} \circ S^{-1}$, $(R^{-1})^{-1} = R$, $\operatorname{dom}(R^{-1}) = \operatorname{ran} R$, and $\Delta_B \circ R = R = R \circ \Delta_A$ for a relation $R$ from $A$ to $B$
- Subset $x \subseteq y$, proper subset $x \subsetneq y$, and the separation notation $\{\, z \in x : \varphi(z) \,\}$
Used by
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 35 results over 15 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
- Equivalence relation (Wikipedia) (standard reference, not scraped)
- B. Kaya, MATH 320 Set Theory (METU), §3.2 (standard reference, not scraped)
- Image (mathematics) (Wikipedia) (standard reference, not scraped)