Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-16
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.

Chosen objectwise universal arrows assemble uniquely into a left adjoint

Statement

Let G:DC be a functor. Suppose that for every cC a universal arrow (Fc,ηc:cGFc) from c to G is supplied. There is a unique functor structure on the object assignment cFc for which η:1CGF is natural, and with that structure FG.

Facts & Assumptions

Given: The functor G and the supplied universal arrows in the Statement.

[F1]

Universality means that every f:cGd factors uniquely as f=G(h)ηc for a morphism h:Fcd (Universal arrows from an object to a functor and from a functor to an object).

[L1]

Chosen initial objects (Fc,ηc) in all (cG) determine a unique left adjoint functor (A left adjoint exists exactly when chosen initial objects are supplied in every comma category).

Proof

technique · direct
1.1

For a:cc, apply [F1] to ηca:cGFc and define F(a) as the unique morphism satisfying G(F(a))ηc=ηca.

F1construct
2.1

The uniqueness clause in [F1] gives F(1c)=1Fc and F(ba)=F(b)F(a), because the proposed right sides satisfy the same defining equations.

step 1.1F1
3.1

Hence F is a functor and the equations in step 1.1 say exactly that η is natural. The same universal factorisations give the adjunction FG by [L1].

step 1.1step 2.1L1
4.1

Any other compatible functor structure would have to satisfy the defining equation in step 1.1, so [F1] makes it identical to this one on every morphism.

step 1.1F1

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 17 results over 11 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources