Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 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.

An ambient object lies in the essential image of a reflective inclusion exactly when its reflection unit is invertible

Statement

For a reflection R⊣I with unit η, an object C∈C is isomorphic to an object in the image of I if and only if ηC:C→IR(C) is an isomorphism.

Facts & Assumptions

Given: A reflection R⊣I as in Reflective full subcategory and reflector, with unit η, and an object C∈C.

[L1]

For a reflector onto a full subcategory, every component εA:RI(A)→A of the counit is an isomorphism (The counit of a reflection is an isomorphism).

[L2]

A morphism f:A→B is an isomorphism if there is g:B→A with g∘f=1A and f∘g=1B; such a g is unique and is denoted f−1 (Isomorphism, groupoid, and connected category).

[L3]

For an adjunction F⊣G with unit η and counit ε, the triangle identities hold componentwise: εFc∘F(ηc)=1Fc and G(εd)∘ηGd=1Gd (Adjunction by unit, counit, and the triangle identities).

Proof

technique · direct
1.1givenL2

If ηC is invertible, it itself displays C as isomorphic to the included object I(R(C)), so C lies in the essential image.

2.1step 1.1L1L2L3∎

Conversely, let u:C→I(A) be an isomorphism. Naturality of η gives IR(u)∘ηC=ηI(A)∘u. The map IR(u) is invertible because a functor sends the inverse of u to its inverse. Applying R⊣I in [L3] at d=A gives I(εA)∘ηI(A)=1I(A), and I(εA) is invertible because εA is by [L1] and functors preserve inverses; composing that identity with I(εA)−1 on the left gives ηI(A)=I(εA)−1, which is therefore an isomorphism. Hence ηC=IR(u)−1∘ηI(A)∘u. A composite g∘f of isomorphisms is an isomorphism, since f−1∘g−1 is a two-sided inverse for it by associativity and the identity laws; applying this twice and using [L2] makes ηC invertible.

Depends on

Used by

Dependency tree · two levels

9 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