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.
Member equivalence is transitive
Statement
For members of one object in an abelian category, the relation is transitive.
Facts & Assumptions
Given: An abelian category and members , , and with and .
The relation is witnessed by epimorphisms from one common domain as in Equivalence of members.
Pullbacks exist in an abelian category (Pullbacks and pushouts as limits and colimits of cospans and spans).
The pullback of an epimorphism is an epimorphism (The pullback of an epimorphism is an epimorphism).
Proof
Choose epimorphisms , , , and with and , using [L1].
Form the pullback of and , with projections and . By [L3], both and are epic.
The pullback equation gives , so . Hence the epimorphisms and witness .
Therefore member equivalence is transitive.
Depends on
Used by
- FALSE: member equivalence is transitive in any pointed category with pullbacks False statement
- Each object has a zero member and each member has a negative Proposition
- The cost of the member calculus Remark
- Four lemma in an abelian category Theorem
- Members modulo equivalence correspond to subobjects Theorem
- Nine lemma in an abelian category Theorem
- Nine lemma variants by which rows are assumed exact Theorem
- Sharp nine lemma Theorem
- Short five lemma in an abelian category Theorem
- The subtraction surrogate Theorem
- Weak four lemma with the exactness hypotheses named Theorem
Dependency tree · two levels
11 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Saunders Mac Lane, Categories for the Working Mathematician, Proposition 2 and Theorem 3 (standard reference, not scraped)