Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-29 rests on unproved material (inherited)
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.

Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

Members modulo equivalence correspond to subobjects

Statement

Let A be an object of an abelian category. Sending a member x:XA to the subobject of A represented by its image inclusion induces a bijection between equivalence classes of members of A and subobjects of A.

Facts & Assumptions

Given: A member x:XA and, when needed, a second member y:YA.

[L1]

Every morphism factors as an epimorphism followed by a monomorphism (Every morphism factors as an epimorphism followed by a monomorphism, uniquely up to unique isomorphism).

[L4]

Member equivalence is transitive (Equivalence of members, Member equivalence is transitive).

Proof

technique · direct
1.1

Factor x as XexIxmxA with ex epic and mx monic, using [L1], and assign to the class of x the subobject [ ⁣mx ⁣] of A.

L1L2construct
1.2

Every subobject is represented. If m:SA is monic, then m itself is a member of A, and the factorization S1SSmA shows that its image class is [ ⁣m ⁣].

L1L2
2.1

This assignment is well defined on equivalence classes. The equality x1X=mxex with epic maps on the right shows xmx, and similarly ymy. If xy, then transitivity from [L4] gives mxmy, which for monomorphisms into A is exactly equality of subobject classes by [L2].

L1L2L4step 1.1
3.1

The assignment is injective. If x and y determine the same subobject, then [ ⁣mx ⁣]=[ ⁣my ⁣] by [L2]. Step 2.1 gives xmx and ymy, while equality of subobjects makes mx and my equivalent as members. Another use of [L4] yields xy.

L2L4step 2.1
4.1

Therefore the assignment of step 1.1 is a bijection from member-equivalence classes to subobjects of A.

step 1.2step 3.1

Depends on

Used by

Dependency tree · two levels

18 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