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.

A full subcategory is reflectively structured exactly when universal arrows are supplied at every ambient object

Statement

Let $A$ be a full subcategory of $C$ , with inclusion $I : A \to C$ . The following supplied data are equivalent:

a reflector $R : C \to A$ and an adjunction $R ⊣ I$ (Reflective full subcategory and reflector);
for every object $C \in C$ , a specified universal arrow $(R_{C}, η_{C})$ from $C$ to $I$ (Universal arrows from an object to a functor and from a functor to an object).

Under this equivalence the specified universal arrows are the components of the reflection unit. Merely asserting their existence, without supplying them object by object, does not supply the functor data in item 1.

Facts & Assumptions

Given: A full inclusion $I : A \to C$ .

[L1]

A reflection consists of a left adjoint $R$ to $I$ , with unit components $η_{C} : C \to I R (C)$ (Reflective full subcategory and reflector).

[L2]

A universal arrow from $C$ to $I$ is a pair $(A, η : C \to I (A))$ such that every $f : C \to I (B)$ factors uniquely as $f = I (h) \circ η$ (Universal arrows from an object to a functor and from a functor to an object).

[L3]

A left adjoint to $I$ is supplied exactly by choosing an initial object, equivalently a universal arrow, in every comma category $(C ↓ I)$ ; the supplied objects determine the functor on morphisms and the adjunction uniquely (A left adjoint exists exactly when chosen initial objects are supplied in every comma category).

Proof

technique · direct

1.1L1L2L3

Suppose item 1 is supplied. By [L3] a supplied left adjoint to $I$ corresponds to an initial object, equivalently a universal arrow, of each comma category $(C ↓ I)$ , and the unit components are exactly those arrows. Hence for each $C$ the unit component $η_{C} : C \to I R (C)$ has the universal factorisation property of [L2], and $(R (C), η_{C})$ is the required specified universal arrow.

2.1L1L2L3step 1.1∎

Conversely, suppose item 2 is supplied. By [L3] the specified initial objects $(R_{C}, η_{C})$ of $(C ↓ I)$ determine a functor $R : C \to A$ and an adjunction $R ⊣ I$ whose unit is $(η_{C})$ ; hence $A$ is reflective by [L1]. No selection beyond the supplied family is made.

Depends on

Used by

Dependency tree · two levels

11 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

E. Riehl, Category Theory in Context, lemma 4.5.11 (standard reference, not scraped)
T. Leinster, Basic Category Theory, section 6.3 (standard reference, not scraped)