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.

The subobject lattice of an abelian category is modular

Statement

For every object A in an abelian category, the lattice of subobjects of A is modular.

Facts & Assumptions

Given: An object A in an abelian category.

[L1]

A modular lattice is one satisfying x≤z⇒x∨(y∧z)=(x∨y)∧z (Modular lattice).

[L3]

Quotienting by the kernel identifies a morphism with its image (First isomorphism theorem in an abelian category).

[L4]

Quotienting nested subobjects satisfies the third isomorphism theorem (Third isomorphism theorem in an abelian category).

[L5]

In an abelian category, a morphism that is both monic and epic is an isomorphism (An abelian category is balanced).

[L6]

The join of two subobjects is the image of the induced map from their biproduct (The join of two subobjects in an abelian category).

[L7]

The meet of two subobjects is represented by their pullback (The meet of two subobjects is their pullback).

Proof

technique · direct
1.1construct

Consider any lattice in which comparable complements of a fixed element coincide in every interval. Let X≤Z and put U:=X∨(Y∧Z),V:=(X∨Y)∧Z. Then U≤V by monotonicity.

1.2L4construct

Fix an interval [B1,B2] of subobjects of A, and write Q:=B2/B1 with quotient map q:B2→Q. If D is any intermediate subobject, let qD:B2→B2/D be its quotient map. Because B1≤D, the composite qD kills B1, so it factors through q as a map q‾D:Q→B2/D. Define Φ(D) to be the kernel subobject of q‾D.

2.1L1step 1.1algebra

Both U and V are complements of Y in the interval [Y∧Z,X∨Y]: one has U∨Y=X∨Y=V∨Y, and Y∧Z≤U≤Z gives U∧Y=Y∧Z, while V≤Z and Y≤X∨Y give V∧Y=Y∧Z. By step 1.1, the interval hypothesis forces U=V. Therefore the modular-law identity of [L1] holds.

2.2L3L4step 1.2construct

Conversely, if S≤Q with quotient map tS:Q→Q/S, define Ψ(S) to be the kernel subobject of tSq in B2. Then B1≤Ψ(S)≤B2. If D lies in the interval, the equality qD=q‾Dq gives Ψ(Φ(D))=D. If S≤Q, the morphism tSq is epic, so its image is all of Q/S; by [L3], B2/Ψ(S)≅Q/S. Under this identification, q‾Ψ(S) is a cokernel of S, so Φ(Ψ(S))=S. Thus Φ and Ψ are inverse bijections between [B1,B2] and the subobject lattice of Q.

3.1step 1.2step 2.2

If D≤E in the interval, then qE factors through qD, so q‾E kills Φ(D). Hence Φ(D)≤Φ(E). The same argument applied to Ψ shows that Φ is an order isomorphism from [B1,B2] onto Sub⁡(Q).

4.1construct

By step 3.1, it is enough to prove the comparable-complements property in Sub⁡(Q). Let E≤Q, and let U≤V be two complements of E. Write t:Q→Q/E for the quotient map.

5.1L5L6L7step 4.1construct

Because U∧E=0, the pullback description [L7] makes the kernel of the restricted map t∣U:U→Q/E trivial. Because U∨E=Q, the canonical map [iU,iE]:U⊕E→Q has image Q by [L6], so composing with t shows that t∣U is epic. By [L5], t∣U is an isomorphism. The same argument shows that t∣V is an isomorphism. Let i:U→V represent the comparison U≤V. Then t∣U=(t∣V) i, so i is an isomorphism. Therefore U and V represent the same subobject of Q.

6.1L1L2step 2.1step 3.1step 5.1∎

Step 5.1 proves that every interval in the subobject lattice has the comparable-complements property, and step 2.1 shows that this property implies the modular law of [L1]. With [L2], this proves that the subobject lattice of A is modular.

Depends on

Used by

Dependency tree · two levels

23 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