Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-29
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.

Members modulo equivalence correspond to subobjects

Statement

Let A be an object of an abelian category. Sending a member x:X→A 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:X→A and, when needed, a second member y:Y→A.

[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.1L1L2construct

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

1.2L1L2

Every subobject is represented. If m:S↣A is monic, then m itself is a member of A, and the factorization S→1SS→mA shows that its image class is [ ⁣m ⁣].

2.1L1L2L4step 1.1

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

3.1L2L4step 2.1

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

4.1step 1.2step 3.1∎

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

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