Alphabeta Math
TheoremStatement: Literature-sourcedProof: 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.

Right adjoints preserve every limit that exists

Statement

Let F:C→D be left adjoint to G:D→C. If a diagram D:J→D has a limit (L,λ), then (GL,Gλ) is a limit of GD. Thus G preserves every limit that exists, for arbitrary indexing categories for which the displayed diagram and cone categories are legitimate.

Facts & Assumptions

Given: An adjunction F⊣G with unit η and counit ε, a diagram D:J→D, and a limiting cone λj:L→Dj.

[F1]

A limit of a diagram is a terminal cone: every cone has a unique mediating morphism to its vertex whose composites with the limiting legs are the given cone legs (Limits and colimits as terminal cones and initial cocones, with existence and uniqueness in their universal properties).

[F2]

A functor preserves a limit when the image of a limiting cone is limiting (Preservation, reflection, and creation of limits and colimits; continuous and cocontinuous functors).

[L1]

The unit and counit are natural and satisfy εFcF(ηc)=1Fc and G(εd)ηGd=1Gd (Adjunction by unit, counit, and the triangle identities).

Proof

technique · direct
1.1L1construct

Let μj:c→GDj be any cone over GD, and define μˉj:=εDj∘F(μj):Fc→Dj.

2.1step 1.1L1

For a:j→k in J, naturality of ε and the cone equation for μ give D(a)μˉj=εDkFGD(a)F(μj)=εDkF(GD(a)μj)=μˉk, so μˉ is a cone over D.

3.1step 2.1F1construct

By [F1], there is a unique h:Fc→L with λjh=μˉj for every j. Define h^:=G(h)ηc:c→GL.

4.1step 1.1step 3.1L1

For each j, G(λj)h^=G(μˉj)ηc=G(εDj)GF(μj)ηc=G(εDj)ηGDjμj=μj, by naturality of η and the second triangle identity.

4.2step 1.1step 3.1F1L1

If k:c→GL also satisfies G(λj)k=μj, then εLF(k):Fc→L mediates μˉ by naturality of ε. Uniqueness in [F1] makes it h, and naturality of η together with the second triangle identity G(εL)ηGL=1GL give k=G(εL)GF(k)ηc=G(εL)ηGLk, that is k=G(h)ηc=h^.

5.1step 4.1step 4.2F1F2∎

Thus every cone over GD factors uniquely through (GL,Gλ), so it is limiting by [F1]. The construction also covers the empty diagram, where there are no leg equations, and [F2] says exactly that G preserves the limit.

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