CorollaryStatement: AI-adaptedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16‡ rests on unproved material (inherited)

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.

‡ Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are ‡ Cohen's first model: an infinite Dedekind-finite set of reals, ‡ Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and ‡ The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

A reflective subcategory of a complete category is complete

Statement

If $A$ is a reflective full subcategory of a complete category $C$ , then $A$ is complete: every small diagram in $A$ has a limit.

Facts & Assumptions

Given: A reflective full inclusion $I : A \to C$ and a complete category $C$ .

[L1]

A reflective inclusion creates every ambient limit in the ordinary isomorphism-invariant sense (A reflective inclusion creates every ambient limit in the ordinary isomorphism-invariant sense).

[L2]

A category is complete when every small diagram in it has a limit, including the empty diagram (Finite, small, and large limits and colimits; complete and cocomplete categories).

Proof

technique · direct

1.1

Let $D$ be any small diagram in $A$ . Completeness of $C$ gives a limit of $I D$ .

givenL2

2.1

By [L1], the inclusion creates from that ambient limit a limit of $D$ in $A$ . This applies to every small $D$ , including the empty diagram, so [L2] proves that $A$ is complete.

step 1.1L1L2∎

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 26 results over 9 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

E. Riehl, Category Theory in Context, corollary 4.5.15 (standard reference, not scraped)