Alphabeta Math
CorollaryStatement: AI-adaptedProof: Literature-sourcedprecheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17
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.

Kleisli and Eilenberg–Moore adjunctions have the extremal universal properties

Statement

Fix a monad T on C. Among supplied adjunctions inducing T on the nose, the Kleisli adjunction has the schematic initial universal property and the Eilenberg–Moore adjunction has the schematic terminal universal property: every such adjunction admits a unique morphism of adjunctions from the Kleisli resolution and a unique morphism of adjunctions to the Eilenberg–Moore resolution.

Facts & Assumptions

Given: A fixed monad T and an arbitrary supplied adjunction inducing it.

[L1]

For an adjunction F⊣U with counit ε inducing T on the nose there is exactly one functor J:CT→D with JFT=F, UJ=UT and J(εBT)=εFB for every B (The Kleisli factorisation functor for an adjunction inducing a monad exists and is unique).

[L2]

For the same adjunction there is exactly one functor K:D→CT with UTK=U, KF=FT and K(εd)=εKdT for every d (The comparison functor to the Eilenberg–Moore category exists and is unique).

Proof

technique · direct
1.1L1

Apply [L1] to the supplied adjunction; its unique factorisation is the required morphism from the Kleisli resolution.

1.2L2

Apply [L2] to the same adjunction; its unique comparison is the required morphism to the Eilenberg–Moore resolution.

2.1step 1.1step 1.2∎

Steps 1.1 and 1.2 give the two asserted existence-and-uniqueness properties for each supplied adjunction. This objectwise assertion does not form a category of all resolutions.

Depends on

Used by

Dependency tree · two levels

7 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