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

Second isomorphism theorem in an abelian category

Statement

Let B and C be subobjects of an object A in an abelian category. Then there is a canonical isomorphism

(B∨C)/C  ≅  B/(B∧C).

Facts & Assumptions

Given: Subobjects b:B↣A and c:C↣A.

[L1]

The join B∨C is the image of the induced map [b,c]:B⊕C→A (The join of two subobjects in an abelian category).

[L2]

The meet B∧C is represented by the pullback of b and c (The meet of two subobjects is their pullback).

[L3]

A morphism modulo its kernel is canonically isomorphic to its image (First isomorphism theorem in an abelian category).

Proof

technique · direct
1.1L2construct

Let q:A→A/C be the quotient map. Consider the composite qb:B→A/C. By [L2], a morphism into B is killed by qb exactly when its composite into A factors through C, which is exactly the pullback condition defining B∧C. So ker⁡(qb)=B∧C.

2.1L1L3step 1.1

By [L3], step 1.1 gives a canonical isomorphism B/(B∧C)≅im⁡(qb). The map q kills C, so its restriction to the join B∨C factors through the quotient (B∨C)/C. Conversely, every summand used in the defining map [b,c] lands in im⁡(qb) after composing with q, because the C-summand dies. Hence im⁡(qb) is exactly the image of B∨C in A/C, namely (B∨C)/C.

3.1step 1.1step 2.1∎

Combining steps 1.1 and 2.1 yields the canonical isomorphism (B∨C)/C≅B/(B∧C).

Depends on

Used by

Dependency tree · two levels

13 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