Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedprecheck 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.

The co-Kleisli adjunction induces the given comonad

Statement

For a comonad G on C, there is an adjunction

LG:CGcoKl⇄C:RG

with LG(A)=GA and RG(A)=A. Its induced comonad LGRG is G on the nose.

Facts & Assumptions

Given: A comonad (G,ε,δ) and its co-Kleisli category.

[L1]

A co-Kleisli arrow A→B is a base arrow GA→B, with composition determined by δ (Co-Kleisli category of a comonad).

[L2]

The Kleisli adjunction construction induces its original monad (The Kleisli adjunction induces the given monad).

Proof

technique · direct
1.1L1L2

Define LG(A)=GA and LG(f)=G(f)δA for f:GA→B. Define RG(A)=A and let RG(u) be the co-Kleisli arrow represented by uεA:GA→B. These are the formal duals of the Kleisli functors.

2.1L1step 1.1

Co-Kleisli associativity and unit laws make both assignments functorial. The equality C(LGA,B)=C(GA,B)=CGcoKl(A,RGB) is a natural identity of hom-sets, so LG⊣RG.

3.1L1L2step 1.1step 2.1∎

The counit of this adjunction is εA:GA→A, while its unit at A is the co-Kleisli arrow represented by 1GA. The triangle identities are the co-Kleisli unit laws, and the induced comultiplication is LG of that unit, namely δA. Thus the induced comonad is (G,ε,δ).

Depends on

Used by

Dependency tree · two levels

5 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