Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-01
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.

With a supplied well-powering, a subobject classifier represents the subobject functor

Statement

Assume C is locally small, has a subobject classifier true:1Ω, and has a supplied well-powering XMX. For each object X, let SubM(X) be the quotient set of MX by mutual factorization. Then XSubM(X) is a contravariant Set-valued functor, and the classifier induces a natural isomorphism

C(,Ω)SubM.

Thus Ω represents the supplied representative-set form of the subobject functor.

Facts & Assumptions

Given: A locally small category C with a subobject classifier true:1Ω and a supplied well-powering XMX.

[L1]

A subobject classifier assigns to each monomorphism m:AX a unique classifying map χm:XΩ whose pullback of true recovers the same subobject (Subobject classifier).

[L2]

A supplied well-powering gives a set MX of monomorphisms into each object X, containing a representative of every subobject class (Well-powered and co-well-powered categories, and supplied well-powerings).

[L3]

Mutual factorization is an equivalence relation on monomorphisms into a fixed object, and subobjects are precisely those equivalence classes (Subobject and quotient object as mutual-factorisation classes of monomorphisms and epimorphisms, Mutual factorisation is an equivalence relation on monomorphisms into an object and dually on epimorphisms out of it).

[L4]

A contravariantly representable functor is a natural isomorphism C(,Ω)P for some presheaf P (Presheaves, covariantly and contravariantly representable functors, and representations).

Proof

technique · direct
1.1

By [L3], the quotient SubM(X):=MX/ by mutual factorization is a well-defined set for each X, and its elements correspond exactly to subobject classes of X represented inside the supplied set MX.

givenL2L3
2.1

For a morphism u:XY and a class [m]SubM(Y), pull back m along u. The resulting monomorphism into X defines a subobject class of X, and [L2] provides a representative of that class in MX; step 1.1 shows that the resulting element of SubM(X) is independent of the chosen representative. Hence XSubM(X) is a contravariant functor.

step 1.1L2L3construct
3.1

For each X, define ΦX:C(X,Ω)SubM(X) by sending f:XΩ to the class of the pullback of true along f. Conversely, define ΨX:SubM(X)C(X,Ω) by sending the class of m to its unique classifying map χm from [L1].

givenL1step 2.1construct
4.1

The composites are identities. If f:XΩ, then ΨX(ΦX(f))=f because the pullback subobject of true along f is classified by f itself, and that classifying map is unique by [L1]. If [m]SubM(X), then the pullback of true along χm represents the same subobject class as m, so ΦX(ΨX([m]))=[m]. Naturality follows because pullback commutes with composition of classifying maps.

step 3.1L1L3algebra
5.1

Therefore Φ is a natural isomorphism C(,Ω)SubM. By [L4], Ω represents the supplied representative-set form of the subobject functor.

step 2.1step 4.1L4

Depends on

Used by

Dependency tree · two levels

16 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