Alphabeta Math
Session-authored (Fable 5 assisted)
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.

40 results · all verified · 19 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 21 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Adjunctions Units and Counits

1 · Prerequisites

2 · Summary

Categories, functors and natural transformations are published, together with whiskering and horizontal composition, the interchange law, functor categories, comma categories, the small / locally small / large distinction, full, faithful and essentially surjective functors, equivalences and adjoint equivalences, and the duality principle. Universal arrows are known to be initial or terminal in the appropriate comma category; hom functors and the hom bifunctor are defined; representable functors and representations are available; and the Yoneda lemma is natural in both variables. Limits and colimits of diagrams, preservation and creation, limit–colimit duality, and the theorem that representable functors preserve small limits complete the categorical background, while free groups, abelianisation, the universal property of free modules and the Stone–Čech compactification supply concrete material.

An adjunction is defined here by functors, a unit, a counit and the two triangle identities, a formulation that stays meaningful without local smallness; transposition recovers the natural hom-set bijection when the hom-classes are sets, and universal arrows and initial comma objects give equivalent encodings, with the choice used to assemble objectwise universal objects into a functor made explicit. Uniqueness, composition, induced adjunctions on functor categories, mates, fixed subcategories, full-faithfulness read off the counit, adjoint triples and Galois connections follow. The unit–counit proof that right adjoints preserve limits carries no size hypothesis, and a representable proof is kept separate and locally small. Exactness consequences and the diagonal-functor adjunctions come next, and the page ends with image and preimage, free groups, free modules, free monoids, abelianisation, the discrete and indiscrete topologies, Stone–Čech, coextension of scalars and currying.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-08-16Open item page →

Adjunction by unit, counit, and the triangle identities

Definition

Let C and D be categories. An adjunction FG consists of functors F:CD and G:DC, a natural transformation

η:1CGF

called the unit, and a natural transformation

ε:FG1D

called the counit, such that the two triangle identities hold:

(εF)(Fη)=1F,(Gε)(ηG)=1G.

Here whiskering and vertical composition are those of Whiskering and horizontal composition of natural transformations. Componentwise, for every cC and dD,

εFcF(ηc)=1Fc,G(εd)ηGd=1Gd.

The direction FG means that F is left adjoint to G and G is right adjoint to F. If η and ε are natural isomorphisms, this is precisely the adjunction data occurring in an adjoint equivalence (Equivalence, quasi-inverse, and adjoint equivalence of categories).

RemarkRemark: AI-adaptedProof: Not applicablejudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16Open item page →

The unit-counit definition imposes no local-smallness hypothesis

The data in Adjunction by unit, counit, and the triangle identities consist only of functors and natural transformations, so they are meaningful for legitimate large categories even when a hom-class is not a set. By contrast, a Set-valued family of hom-set bijections presupposes local smallness as defined in Small, locally small, and large categories. The hom-set formulation remains equivalent under that hypothesis, but it is not used as the definition here because the size condition belongs to that encoding rather than to adjunctions themselves.

PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16Open item page →

An adjoint equivalence is an adjunction whose unit and counit are natural isomorphisms

Statement

For functors F:CD and G:DC, the following data are equivalent:

  1. an adjoint equivalence between C and D with functors F and G;
  2. an adjunction FG (Adjunction by unit, counit, and the triangle identities) whose unit and counit are natural isomorphisms.

Consequently, every equivalence of categories can be equipped with such an adjunction.

Facts & Assumptions

Given: Categories C,D and functors F:CD, G:DC.

[F1]

An adjoint equivalence consists of F,G, a natural isomorphism η:1CGF, a natural isomorphism ε:FG1D, and the two triangle identities (Equivalence, quasi-inverse, and adjoint equivalence of categories).

[F2]

Every equivalence of categories admits a choice of unit and counit satisfying the triangle identities, and hence can be equipped as an adjoint equivalence (Every equivalence of categories can be equipped as an adjoint equivalence).

Proof

technique · direct
1.1

Starting with an adjoint equivalence, forget only the assertion that η and ε are invertible. The remaining functors, natural transformations, and triangle identities are an adjunction, while the forgotten assertion still says its unit and counit are natural isomorphisms.

F1
1.2

Conversely, an adjunction with invertible unit and counit has exactly the functors, natural isomorphisms, and triangle identities required by [F1], so it is an adjoint equivalence.

F1
2.1

Finally, [F2] equips any equivalence with the data in step 1.1, proving the consequence.

F2step 1.1
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16Open item page →

Adjuncts and transposition under an adjunction

Definition

Let FG:DC be an adjunction in the sense of Adjunction by unit, counit, and the triangle identities, with unit η and counit ε. For objects cC and dD:

  • the right adjunct, or transpose, of u:Fcd is u:=G(u)ηc:cGd;
  • the left adjunct, or inverse transpose, of v:cGd is v:=εdF(v):Fcd.

The symbols () and () always refer to the displayed adjunction; when several adjunctions occur, the relevant unit and counit are named explicitly.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16Open item page →

The unit and counit transpose formulas are mutually inverse

Statement

Let FG have unit η and counit ε. For every u:Fcd and v:cGd,

(u)=u,(v)=v,

where transposition is defined in Adjuncts and transposition under an adjunction.

Facts & Assumptions

Given: An adjunction FG with unit η and counit ε, objects c,d, and morphisms u:Fcd and v:cGd.

[L1]

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

[L2]

The transpose formulas are u=G(u)ηc and v=εdF(v) (Adjuncts and transposition under an adjunction).

Proof

technique · direct
1.1

Expanding the first composite gives (u)=εdFG(u)F(ηc).

L2algebra
1.2

Naturality of ε at u gives εdFG(u)=uεFc.

given
1.3

Expanding the second composite gives (v)=G(εd)GF(v)ηc.

L2algebra
1.4

Naturality of η at v gives GF(v)ηc=ηGdv.

given
2.1

Substituting step 1.2 into step 1.1 and applying the first triangle identity yields (u)=uεFcF(ηc)=u.

step 1.1step 1.2L1
3.1

Substituting step 1.4 into step 1.3 and applying the second triangle identity yields (v)=G(εd)ηGdv=v.

step 1.3step 1.4L1
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-16Open item page →

Under local smallness, transposition gives the natural hom-set bijection, and conversely

Statement

Let C and D be locally small categories and let F:CD and G:DC be functors.

An adjunction FG determines bijections

Φc,d:D(Fc,d)  C(c,Gd),Φc,d(u)=G(u)ηc,

natural in c and d, whose inverses are Ψc,d(v)=εdF(v). Conversely, every such natural family of bijections determines a unique unit and counit satisfying the triangle identities, and hence a unique adjunction structure on F and G.

Facts & Assumptions

Given: Locally small categories C,D and functors F:CD, G:DC.

[F1]

In a locally small category every hom-collection is a set (Small, locally small, and large categories).

[F2]

In a locally small category the two-variable hom assignment is a Set-valued bifunctor, contravariant in its first variable and covariant in its second (The covariant and contravariant hom-assignments and the hom-bifunctor of a locally small category).

[L1]

Under an adjunction, the two transpose formulas are mutually inverse on every pair of hom-collections (The unit and counit transpose formulas are mutually inverse).

[L2]

The transpose formulas are u=G(u)ηc and v=εdF(v) (Adjuncts and transposition under an adjunction).

Proof

technique · direct
1.1

Given an adjunction, [F1] makes the displayed hom-collections sets, and [L1] shows that Φc,d and Ψc,d are inverse bijections.

F1L1
1.2

For a:cc, b:dd, and u:Fcd, functoriality and naturality of η give Φc,d(buF(a))=G(b)Φc,d(u)a; this is naturality in both variables in the sense of [F2].

L2F2algebra
1.3

Conversely, let Φ be a natural family of bijections with inverse Ψ. Define ηc:=Φc,Fc(1Fc) and εd:=ΨGd,d(1Gd).

construct
2.1

Naturality of Φ in c makes η natural, and naturality of Ψ in d makes ε natural.

step 1.3F2
2.2

Naturality in d and c, respectively, gives Φc,d(u)=G(u)ηc and Ψc,d(v)=εdF(v).

step 1.3F2
3.1

Since ΨΦ fixes 1Fc, step 2.2 gives εFcF(ηc)=1Fc; since ΦΨ fixes 1Gd, it gives G(εd)ηGd=1Gd.

step 2.2algebra
4.1

Thus the data of steps 1.3 and 2.1 satisfy both triangle identities and define an adjunction. Any unit and counit inducing Φ must be the transposes of the two identity morphisms, so step 1.3 also proves uniqueness.

step 1.3step 2.1step 3.1
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16Open item page →

A square commutes if and only if its transposed square commutes

Statement

Let FG be an adjunction between locally small categories. Suppose

u:Fcd,u:Fcd,a:cc,b:dd.

Then

bu=uF(a)G(b)u=(u)a.

The analogous equivalence holds after applying inverse transposition to a square between morphisms cGd.

Facts & Assumptions

Given: The adjunction and the four typed morphisms in the Statement.

[L1]

Transposition is a bijection natural in both variables: for a:cc, b:dd and v:Fcd, one has Φc,d(bvF(a))=G(b)Φc,d(v)a (Under local smallness, transposition gives the natural hom-set bijection, and conversely).

Proof

technique · direct
1.1

If bu=uF(a), apply transposition. By [L1], the transpose of the left side is G(b)u, while the transpose of the right side is (u)a, so the transposed square commutes.

L1
1.2

Conversely, if the transposed square commutes, apply the inverse bijection to its two sides. The two inverse images are bu and uF(a) by [L1], so the original square commutes.

L1
2.1

Repeating steps 1.1 and 1.2 with the inverse bijections proves the analogous assertion for inverse transposition.

step 1.1step 1.2L1
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16Open item page →

Unit components are initial in comma categories, and counit components are terminal

Statement

Let FG have unit η and counit ε.

  1. For each cC, (Fc,ηc:cGFc) is a universal arrow from c to G, hence an initial object of (cG).
  2. For each dD, (Gd,εd:FGdd) is a universal arrow from F to d, hence a terminal object of (Fd).

No local-smallness hypothesis is needed.

Facts & Assumptions

Given: An adjunction FG with unit η and counit ε.

[F1]

A universal arrow from c to G is a pair (R,ρ:cGR) such that every f:cGd factors uniquely as G(h)ρ; dually, a universal arrow from F to d has the corresponding unique factorisation property (Universal arrows from an object to a functor and from a functor to an object).

[F2]

A universal arrow from an object to a functor is initial in the associated comma category, and a universal arrow from a functor to an object is terminal in the dual comma category (Universal arrows to a functor are initial in comma categories, and universal arrows from a functor are terminal).

[L1]

The formulas hG(h)ηc and fεdF(f) are mutually inverse for an adjunction (The unit and counit transpose formulas are mutually inverse, Adjuncts and transposition under an adjunction).

Proof

technique · direct
1.1

Fix c and a morphism f:cGd. Its inverse transpose f:Fcd satisfies G(f)ηc=f, and it is the unique morphism with this property because transposition is injective.

L1
1.2

Dually, for u:Fcd, its transpose u:cGd is the unique morphism satisfying εdF(u)=u.

L1
2.1

Thus (Fc,ηc) has the universal property in [F1], and [F2] makes it initial in (cG).

step 1.1F1F2
3.1

Hence (Gd,εd) is universal from F to d and terminal in (Fd). The argument used individual morphisms and uniqueness only, so it imposed no set-size condition on any hom-class.

step 1.2F1F2
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16Open item page →

The unit-counit, hom-set, unit-universal, and counit-universal encodings of an adjunction are equivalent

Statement

For functors F:CD and G:DC, the following descriptions carry the same adjunction data:

  1. a unit and counit satisfying the triangle identities;
  2. when C and D are locally small, a natural family of bijections D(Fc,d)C(c,Gd);
  3. a natural family of universal arrows (Fc,ηc) from each c to G;
  4. a natural family of universal arrows (Gd,εd) from F to each d.

Only description 2 requires local smallness.

Facts & Assumptions

Given: Categories C,D and functors F:CD, G:DC.

[L1]

An adjunction is functors together with a unit, counit, and the two triangle identities (Adjunction by unit, counit, and the triangle identities).

[L2]

Under local smallness, unit-counit data and natural hom-set bijections determine one another uniquely (Under local smallness, transposition gives the natural hom-set bijection, and conversely).

[L3]

Unit components are universal arrows and initial comma objects, while counit components are universal arrows and terminal comma objects (Unit components are initial in comma categories, and counit components are terminal).

Proof

technique · direct
1.1

Descriptions 1 and 2 determine one another by [L2], including the recovery formulas obtained by transposing identity morphisms.

L2
1.2

Description 1 gives descriptions 3 and 4 by [L3].

L3
1.3

Conversely, from description 3, put u:=G(u)ηc for u:Fcd; the unique-factorisation property of (Fc,ηc) says exactly that this is a bijection onto the morphisms cGd, with inverse the unique factorisation. Define εd:FGdd as the unique morphism with G(εd)ηGd=1Gd, which is the second triangle identity. For g:dd the two morphisms gεd and εdFG(g) have the same factorisation datum, since G(g)G(εd)ηGd=G(g) and G(εd)GFG(g)ηGd=G(εd)ηGdG(g)=G(g); uniqueness makes ε natural. Likewise G(εFc)GF(ηc)ηc=G(εFc)ηGFcηc=ηc=G(1Fc)ηc, so uniqueness gives the first triangle identity εFcF(ηc)=1Fc. This recovers a unit and counit satisfying [L1].

L1L3
2.1

The dual construction from description 4 defines ηc:cGFc as the unique morphism with εFcF(ηc)=1Fc, proves its naturality from terminality of (Gd,εd) in (Fd) by the argument of step 1.3 read in the opposite categories, and yields the second triangle identity the same way. It therefore gives the same unit-counit data.

step 1.3L1L3
3.1

Steps 1.1 through 2.1 establish all implications. Since [L3] is expressed by unique individual factorisations, descriptions 1, 3, and 4 remain meaningful without local smallness, whereas [L2] explicitly uses hom-sets.

step 1.1step 1.2step 1.3step 2.1
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16Open item page →

A left adjoint exists exactly when chosen initial objects are supplied in every comma category

Statement

Let G:DC be a functor. A left adjoint to G is supplied exactly by choosing, for every cC, an initial object (Fc,ηc) of the comma category (cG). These choices determine the action of F on morphisms and the adjunction uniquely.

Dually, a right adjoint to F:CD is supplied exactly by choosing a terminal object in every comma category (Fd).

Facts & Assumptions

Given: A functor G:DC.

[F1]

The comma category (cG) has objects (d,f:cGd), and a morphism from (d,f) to (d,f) is a morphism h:dd with G(h)f=f (Comma category, slice category, and coslice category).

[L1]

If FG, then (Fc,ηc) is initial in (cG) for every c; dually, counit components are terminal in (Fd) (Unit components are initial in comma categories, and counit components are terminal).

[L2]

Unit-counit data with the triangle identities and a natural family of universal arrows (Fc,ηc) from each c to G carry the same adjunction data, and neither description requires local smallness (The unit-counit, hom-set, unit-universal, and counit-universal encodings of an adjunction are equivalent).

Proof

technique · direct
1.1

If a left adjoint F is supplied, [L1] gives the required chosen initial object (Fc,ηc) for every c.

L1
1.2

Conversely, suppose such initial objects are supplied. For a:cc, initiality gives a unique F(a):FcFc satisfying G(F(a))ηc=ηca.

F1choose
2.1

The identity 1Fc satisfies the defining equation for F(1c), so uniqueness gives F(1c)=1Fc.

step 1.2F1
2.2

If a:cc and b:cc, then F(b)F(a) satisfies the defining equation for F(ba); uniqueness gives F(ba)=F(b)F(a). Thus F is a functor and η is natural.

step 1.2F1
3.1

For every f:cGd, initiality supplies a unique f^:Fcd with G(f^)ηc=f. Steps 2.1 and 2.2 make F a functor and η natural, so (Fc,ηc)c is a natural family of universal arrows from each c to G; by [L2] that data is an adjunction, so FG.

step 1.2step 2.1step 2.2F1L2
4.1

Any functor action compatible with the chosen initial objects must satisfy the equation in step 1.2 and is therefore equal to this one. Passing to opposite categories proves the terminal-object criterion for right adjoints.

step 1.2step 3.1
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-16Open item page →

Chosen objectwise universal arrows assemble uniquely into a left adjoint

Statement

Let G:DC be a functor. Suppose that for every cC a universal arrow (Fc,ηc:cGFc) from c to G is supplied. There is a unique functor structure on the object assignment cFc for which η:1CGF is natural, and with that structure FG.

Facts & Assumptions

Given: The functor G and the supplied universal arrows in the Statement.

[F1]

Universality means that every f:cGd factors uniquely as f=G(h)ηc for a morphism h:Fcd (Universal arrows from an object to a functor and from a functor to an object).

[L1]

Chosen initial objects (Fc,ηc) in all (cG) determine a unique left adjoint functor (A left adjoint exists exactly when chosen initial objects are supplied in every comma category).

Proof

technique · direct
1.1

For a:cc, apply [F1] to ηca:cGFc and define F(a) as the unique morphism satisfying G(F(a))ηc=ηca.

F1construct
2.1

The uniqueness clause in [F1] gives F(1c)=1Fc and F(ba)=F(b)F(a), because the proposed right sides satisfy the same defining equations.

step 1.1F1
3.1

Hence F is a functor and the equations in step 1.1 say exactly that η is natural. The same universal factorisations give the adjunction FG by [L1].

step 1.1step 2.1L1
4.1

Any other compatible functor structure would have to satisfy the defining equation in step 1.1, so [F1] makes it identical to this one on every morphism.

step 1.1F1
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-16Open item page →

A supplied pointwise right adjoint extends uniquely to a functor

Statement

Let F:CD be a functor between locally small categories. Suppose an object GdC is supplied for every dD, together with an isomorphism

θd:D(F(),d)C(,Gd)

natural in the variable of C. Then the object assignment dGd has a unique functor structure for which the θd are natural in d, and FG.

Facts & Assumptions

Given: The functor F, supplied objects Gd, and representing isomorphisms θd as in the Statement.

[F1]

A representation of a presheaf is an object together with a natural isomorphism from the corresponding representable presheaf (Presheaves, covariantly and contravariantly representable functors, and representations).

[F2]

The Yoneda bijection is natural in both the represented object and the presheaf, so a natural transformation between represented presheaves is induced by a unique morphism between their representing objects (The Yoneda bijection Nat(C(a,),F)F(a) is natural in both a and F).

[L1]

A natural family D(Fc,d)C(c,Gd) determines an adjunction (Under local smallness, transposition gives the natural hom-set bijection, and conversely).

Proof

technique · direct
1.1

For h:dd, postcomposition by h gives a natural transformation D(F(),d)D(F(),d). Transport it through θd and θd; [F2] supplies a unique morphism G(h):GdGd representing the result.

F1F2construct
2.1

Postcomposition by an identity is the identity transformation, so Yoneda uniqueness gives G(1d)=1Gd.

step 1.1F2
2.2

Postcomposition by kh is the composite of postcomposition by h and by k, so Yoneda uniqueness gives G(kh)=G(k)G(h). Thus G is a functor.

step 1.1F2
3.1

The definition in step 1.1 makes θ natural in d; it was natural in c by hypothesis. Therefore [L1] gives FG.

step 1.1step 2.1step 2.2L1
4.1

If another functor structure made every θd natural, its value on h would induce the same transported natural transformation, so [F2] would force it to equal G(h). The supplied object assignment also shows that no class-sized selection was made in the proof.

step 1.1F2
RemarkRemark: Literature-sourcedProof: Not applicablejudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16 rests on unproved material (inherited)Open item page →
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.

Objectwise existence does not itself supply a class-sized choice of adjoint values

The reverse implications in A left adjoint exists exactly when chosen initial objects are supplied in every comma category and A supplied pointwise right adjoint extends uniquely to a functor begin with chosen objects as data. An assertion that a suitable object exists separately for every object of a proper class does not by itself provide one class-function selecting them all. This is the same distinction recorded for limit and colimit functors in A limit for each diagram need not provide a chosen limit functor without a simultaneous choice of representatives: after the object assignment is supplied, universal uniqueness determines the morphism assignment without further choice.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16Open item page →

Adjoints are unique up to a unique natural isomorphism compatible with the adjunction data

Statement

Suppose FG and FG are two left adjoints to the same functor, with units η and η. There is a unique natural isomorphism α:FF satisfying

G(αc)ηc=ηc

for every c. It also intertwines the two counits. Dually, two right adjoints to the same functor are uniquely naturally isomorphic in a way compatible with their adjunction data. No local-smallness hypothesis is needed.

Facts & Assumptions

Given: Adjunctions FG and FG, with units η,η and counits ε,ε.

[L1]

An adjunction supplies a natural unit and counit satisfying the two triangle identities, in particular GεηG=1G (Adjunction by unit, counit, and the triangle identities).

[L2]

Each (Fc,ηc) and (Fc,ηc) is initial in (cG), and no local-smallness hypothesis is needed (Unit components are initial in comma categories, and counit components are terminal).

Proof

technique · direct
1.1

By initiality of (Fc,ηc) there is a unique αc:FcFc with G(αc)ηc=ηc; reversing the roles gives a unique βc:FcFc with G(βc)ηc=ηc.

L2
2.1

The composites βcαc and 1Fc both carry ηc to itself, so initiality gives βcαc=1Fc; similarly αcβc=1Fc.

step 1.1L2
2.2

Let a:cc. The object (Fc,ηca) lies in (cG), so by initiality of (Fc,ηc) exactly one morphism FcFc composes with ηc to ηca. Both candidates do: G(Faαc)ηc=G(Fa)ηc=ηca by naturality of η, and G(αcFa)ηc=G(αc)ηca=ηca by naturality of η. Hence Faαc=αcFa and α is natural. This uses only initiality and naturality of the units, so no local smallness is required.

step 1.1L1L2
3.1

Any natural transformation compatible with the units has components satisfying the uniqueness condition in step 1.1 and hence equals α. For counit compatibility, both εd and εdαGd are morphisms FGdd, and initiality of (FGd,ηGd) determines such a morphism by its composite: G(εd)ηGd=1Gd by the triangle identity of [L1], while G(εd)G(αGd)ηGd=G(εd)ηGd=1Gd by step 1.1 and the triangle identity for FG. So εdαGd=εd. Passing to opposite categories proves the dual assertion.

step 1.1step 2.2L1L2
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-16Open item page →

Adjunctions compose with the composite unit and counit formulas

Statement

Let F:CD be left adjoint to G:DC, with unit η and counit ε, and let F:DE be left adjoint to G:ED, with unit η and counit ε. Then

FFGG

with unit and counit

ηˉ=(GηF)η:1CGGFF,

εˉ=ε(FεG):FFGG1E.

Facts & Assumptions

Given: The two adjunctions and their units and counits as in the Statement.

[L1]

An adjunction is determined by a unit, a counit, and the two triangle identities (Adjunction by unit, counit, and the triangle identities).

[F1]

Whenever the expressions are defined, the interchange identity is (ββ)(αα)=(βα)(βα) (Horizontal and vertical composition of natural transformations satisfy the interchange law).

Proof

technique · direct
1.1

Whiskering gives GηF:GFGGFF and FεG:FFGGFG, so the displayed composites have the required types; they are natural because whiskering and vertical composition preserve naturality.

F1
2.1

Expanding the first triangle composite for FF gives (εˉFF)(FFηˉ)=(εFF)(FεGFF)(FFGηF)(FFη). Interchange rewrites the two middle factors as F[(εGFF)(FGηF)], and naturality of ε at the component ηFc turns that bracket into (ηF)(εF).

F1step 1.1
2.2

Expanding the second triangle composite for GG gives (GGεˉ)(ηˉGG)=(GGε)(GGFεG)(GηFGG)(ηGG). Interchange rewrites the two middle factors as G[(GFεG)(ηFGG)], and naturality of η at the component εGd turns that bracket into (ηG)(εG). The composite becomes G[(Gε)(ηG)][(Gε)(ηG)]G, which by the two second triangle identities GεηG=1G and GεηG=1G is 1GG.

F1L1step 1.1
3.1

By step 2.1 the first composite becomes [(εF)(Fη)]FF[(εF)(Fη)], which by the two first triangle identities εFFη=1F and εFFη=1F is 1FF.

L1step 2.1
4.1

Thus ηˉ and εˉ satisfy both triangle identities, and [L1] gives FFGG.

step 3.1step 2.2L1
PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-16Open item page →

An adjunction induces postcomposition and precomposition adjunctions on legitimate functor categories

Statement

Let FG:DC. Whenever the indicated functor categories are legitimate:

  1. postcomposition gives an adjunction F:[J,C][J,D]:G;
  2. precomposition gives an adjunction G:[C,E][D,E]:F.

If J is small and C,D are locally small, the functor categories in clause 1 are locally small.

Facts & Assumptions

Given: An adjunction FG with unit η and counit ε, and categories for which the displayed functor categories are formed.

[F1]

For a small source category, functors and natural transformations form the functor category (Functor category [C,D]).

[F2]

If the source is small and the target is locally small, the resulting functor category is locally small (If C is small and D is locally small then [C,D] is locally small; if both are small it is small).

[L1]

The triangle identities are (εF)(Fη)=1F and (Gε)(ηG)=1G (Adjunction by unit, counit, and the triangle identities).

Proof

technique · direct
1.1

Postcomposition sends H:JC to FH and K:JD to GK. Whiskering η and ε gives unit components ηH:HGFH and counit components εK:FGKK.

F1L1
1.2

Precomposition sends H:CE to HG and K:DE to KF. Whiskering now gives the unit Hη:HHGF and counit Kε:KFGK, so GF.

F1L1
2.1

The two triangle identities hold at every object of J by [L1], hence hold as equalities of natural transformations. Therefore FG.

step 1.1L1
3.1

Again the triangle identities are the images under H and K of those in [L1]. The size assertion follows from [F2]; the componentwise unit-counit construction itself uses only legitimate functors and natural transformations.

step 1.2F2L1
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-16Open item page →

Natural transformations have mates under a pair of adjunctions

Statement

Let FG:DC and FG:DC have units η,η and counits ε,ε. For functors H:CC and K:DD, there is a bijection between natural transformations

α:FHKF

and their right mates

α:HGGK.

The right mate and inverse construction are

α=(GKε)(GαG)(ηHG),

β=(εKF)(FβF)(FHη).

When the two adjunctions coincide and H=1C, K=1D, the mate of 1F is 1G. Mates respect typed vertical and horizontal pasting. No local-smallness hypothesis is needed.

For a general pair of adjunctions the mate of an identity transformation need not be an identity transformation: α has source HG and target GK, and these functors need not be equal.

Facts & Assumptions

Given: The adjunctions, functors, and typed transformations in the Statement.

[L1]

Each adjunction supplies natural units, counits, and two triangle identities (Adjunction by unit, counit, and the triangle identities).

[L2]

The left whiskering Hα has components H(αA) and the right whiskering αK has components αKB; each is a horizontal composite of α with an identity transformation, and horizontal composites of natural transformations satisfy naturality (Whiskering and horizontal composition of natural transformations, Horizontal composites of natural transformations satisfy naturality).

[L3]

The vertical composite of natural transformations satisfies naturality (Vertical composites of natural transformations satisfy naturality).

[F1]

The interchange identity is (ββ)(αα)=(βα)(βα) whenever the expressions are defined (Horizontal and vertical composition of natural transformations satisfy the interchange law).

Proof

technique · direct
1.1

Whiskering shows that the three factors defining α have successive types HGGFHGGKFGGK; the three factors defining β have successive types FHFHGFFGKFKF.

L1
1.2

Each of those six factors is a whiskering of one of η, α, ε, ε, β, η, every one of which is natural by [L1] and the hypothesis on α and β; so each factor is natural by [L2], and the two vertical composites are natural by [L3]. Only the unit–counit data enters, so the argument applies whether or not the four categories are locally small.

L1L2L3
1.3

When the two adjunctions coincide and H,K are identity functors, the middle factor G1FG is the identity transformation of GFG, so the mate of 1F is (Gε)(ηG), which is 1G by the triangle identity of [L1]. For a typed vertical or horizontal pasting, expand the displayed formulas; interchange identifies the expansion with the corresponding pasting of the mates, with the order fixed by the types.

L1F1
2.1

Substitute α into the formula for (). Interchange moves the two unit-counit pairs together, and the triangle identities cancel both pairs, leaving α.

step 1.1F1L1
2.2

Substituting β into the formula for () gives the dual cancellation and leaves β. Thus the constructions are inverse.

step 1.1F1L1
3.1

Hence the formulas give the asserted bijection, carry 1F to 1G in the coinciding-adjunction case, and preserve both forms of compatible pasting.

step 2.1step 2.2step 1.3
RemarkRemark: Literature-sourcedProof: Not applicablejudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16Open item page →

Conjugation preserves invertibility but the general mates correspondence need not

When both adjunctions in Natural transformations have mates under a pair of adjunctions are adjoint equivalences, all unit and counit components in the mate formulas are isomorphisms. A mate is then obtained from the original transformation by whiskering and composing with isomorphisms, so invertibility is preserved. For a general adjunction the unit or counit need not be invertible; an identity transformation can have such a component as its mate. The mates bijection therefore preserves equations and typed pasting, not invertibility in general.

PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16Open item page →

An adjunction restricts to an equivalence on the subcategories fixed by its unit and counit

Statement

For an adjunction FG, let Cη be the full subcategory of objects c for which ηc is an isomorphism, and let Dε be the full subcategory of objects d for which εd is an isomorphism. Then F and G restrict to an adjoint equivalence

CηDε.

Facts & Assumptions

Given: An adjunction FG with unit η and counit ε.

[F1]

A full subcategory contains chosen objects and all morphisms between them from the ambient category (Subcategory and full subcategory).

[F2]

An equivalence consists of quasi-inverse functors and natural isomorphisms between their composites and the identity functors (Equivalence, quasi-inverse, and adjoint equivalence of categories).

[L1]

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

Proof

technique · direct
1.1

If ηc is invertible, then F(ηc) is invertible, and the first triangle identity makes εFc=F(ηc)1; hence FcDε.

L1
1.2

Dually, if εd is invertible, then the second triangle identity makes ηGd=G(εd)1; hence GdCη.

L1
2.1

By [F1], F and G therefore restrict to functors between the two full subcategories, and the restricted unit and counit remain natural.

step 1.1step 1.2F1
3.1

Every component of the restricted unit and counit is an isomorphism by definition, so [F2] makes the restrictions quasi-inverse equivalences; the inherited triangle identities make the equivalence adjoint.

step 2.1F2L1
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-16Open item page →

Fullness and faithfulness of a right adjoint are detected by its counit

Statement

Let FG:DC be an adjunction between locally small categories, with counit ε:FG1D.

  1. G is faithful if and only if every εd is an epimorphism.
  2. G is full if and only if every εd is a split monomorphism.
  3. G is fully faithful if and only if ε is a natural isomorphism.

Dually, F is faithful exactly when every unit component is monic, full exactly when every unit component is split epic, and fully faithful exactly when the unit is a natural isomorphism.

Facts & Assumptions

Given: The adjunction in the Statement, with unit η and counit ε.

[F1]

A functor is faithful when every induced hom-set map is injective, full when every such map is surjective, and fully faithful when every such map is bijective (Faithful, full, fully faithful, essentially surjective, and split essentially surjective functors).

[F2]

A morphism e:AB is epic when re=se implies r=s for every parallel pair r,s:BX (Monomorphism and epimorphism by left and right cancellation).

[F3]

A morphism e:AB is a split monomorphism when there is r:BA with re=1A (Split monomorphism, split epimorphism, retraction, and section).

[L1]

Transposition gives natural bijections D(Fc,d)C(c,Gd) (Under local smallness, transposition gives the natural hom-set bijection, and conversely).

Proof

technique · direct
1.1

If G is faithful and rεd=sεd, then G(r)G(εd)=G(s)G(εd); composing with ηGd and using the triangle identity gives G(r)=G(s), hence r=s. Thus each εd is epic.

F1F2L1
1.2

Conversely, if every εd is epic and G(r)=G(s), naturality gives rεd=εeFG(r)=εeFG(s)=sεd, so r=s. Hence G is faithful.

F1F2
1.3

If G is full, lift ηGd:GdGFGd to qd:dFGd with G(qd)=ηGd. Naturality of ε and the first triangle identity give qdεd=εFGdFG(qd)=εFGdF(ηGd)=1FGd, so εd is split monic.

F1F3
2.1

Conversely, choose qd with qdεd=1FGd. Then G(qd) is the inverse of G(εd), whose right inverse is ηGd by the triangle identity, so G(qd)=ηGd. For h:GdGe, the morphism r:=εeF(h)qd:de satisfies G(r)=G(εe)GF(h)ηGd=h, using naturality of η and the triangle identity. Thus G is full.

F1F3L1step 1.3
3.1

A fully faithful G makes εd both epic and split monic by steps 1.1 and 1.3; if qdεd=1, epicity gives εdqd=1, so εd is an isomorphism. Conversely, an invertible counit is epic and split monic, so steps 1.2 and 2.1 make G fully faithful.

step 1.1step 1.2step 1.3step 2.1F2F3
4.1

Passing to opposite categories exchanges the counit with the unit, faithful with faithful, epic with monic, and split monic with split epic, proving the dual assertions.

step 3.1
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16Open item page →

Adjoint triple LMR

Definition

An adjoint triple LMR consists of categories C,D, functors

L,R:DC,M:CD,

and adjunctions LM and MR in the sense of Adjunction by unit, counit, and the triangle identities. Thus the middle functor is simultaneously a right adjoint and a left adjoint, with separate units and counits for the two adjunctions.

PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16Open item page →

An adjoint triple induces adjunctions between its associated endofunctors

Statement

If LMR, with L,R:DC and M:CD, then

LMRMon C,

and

MLMRon D.

These adjunctions use the composite units and counits and require no local-smallness hypothesis.

Facts & Assumptions

Given: An adjoint triple LMR.

[L1]

An adjoint triple supplies adjunctions LM and MR with the displayed functor types (Adjoint triple LMR).

[L2]

If FG and FG, then FFGG with the composite unit and counit formulas (Adjunctions compose with the composite unit and counit formulas).

Proof

technique · direct
1.1

Compose MR with LM in [L2]. The left composite is LM:CC and the right composite is RM:CC, so LMRM.

L1L2
1.2

Compose LM with MR in [L2]. The left composite is ML:DD and the right composite is MR:DD, so MLMR.

L1L2
2.1

In each case the unit is obtained by inserting the second unit between the first unit's functors, and the counit by inserting the first counit between the second counit's functors, exactly as in [L2]. Since [L2] uses unit-counit data, neither construction requires hom-sets.

step 1.1step 1.2L2
DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-08-16Open item page →

Mutually left and mutually right adjoint contravariant functors

Definition

Let S:CopD and T:DopC be contravariant functors (Covariant functor, identity functor, composite functor, and contravariant functor) between locally small categories (Small, locally small, and large categories). They are mutually left and mutually right adjoint when there are bijections

D(d,Sc)C(c,Td)

natural in cC and dD. Equivalently, the covariant functors S:CopD and Top:DCop form an adjoint pair, and the same data give the opposite adjunction after reversing both categories.

DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-08-16Open item page →

Galois connection between preorders

Definition

Let A and B be preorders (Preorder and monotone map). A Galois connection FG consists of monotone maps F:AB and G:BA such that, for every aA and bB,

F(a)baG(b).

Under the identification of preorders with thin categories in A preorder is a category with at most one morphism between any two objects, and its functors are exactly monotone maps, this is exactly an adjunction. The corresponding unit and counit are the inequalities

aGF(a),FG(b)b.

CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-16Open item page →

A Galois connection between posets satisfies FGF=F and GFG=G

Statement

Let A,B be posets and let F:AB, G:BA form a Galois connection. Then

FGF=F,GFG=G.

For preorders, the same argument gives pointwise equivalences FGFF and GFGG in the associated thin categories, but equality need not follow without antisymmetry.

Facts & Assumptions

Given: Posets A,B and a Galois connection FG.

[L1]

A Galois connection satisfies aGF(a) and FG(b)b, and both maps are monotone (Galois connection between preorders).

[F1]

Antisymmetry says that xy and yx imply x=y (Partial order and partially ordered set).

Proof

technique · direct
1.1

Applying F to aGF(a) gives F(a)FGF(a), while the counit inequality at F(a) gives FGF(a)F(a).

L1
1.2

Applying G to FG(b)b gives GFG(b)G(b), while the unit inequality at G(b) gives G(b)GFG(b).

L1
2.1

Antisymmetry applied to steps 1.1 and 1.2 gives FGF(a)=F(a) and GFG(b)=G(b) for every a,b, hence the two equalities of maps.

step 1.1step 1.2F1
3.1

Without antisymmetry, steps 1.1 and 1.2 still give morphisms in both directions between the corresponding objects of each thin category, which are inverse because parallel morphisms are unique.

step 1.1step 1.2
PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16Open item page →

In a poset adjunction the triangle identities are automatic

Statement

Let F:AB and G:BA be monotone maps between posets. If there are natural transformations η:1AGF and ε:FG1B, equivalently the pointwise inequalities

aGF(a),FG(b)b,

then both triangle identities hold automatically. In particular, the unit and counit inequalities of a Galois connection determine an adjunction without a separate triangle calculation.

Facts & Assumptions

Given: The monotone maps and pointwise inequalities in the Statement.

[F1]

A preorder determines a category with at most one morphism between any two objects, and functors between such categories are exactly monotone maps (A preorder is a category with at most one morphism between any two objects, and its functors are exactly monotone maps).

[L1]

A Galois connection supplies the unit inequalities aGF(a) and counit inequalities FG(b)b (Galois connection between preorders).

Proof

technique · direct
1.1

By [F1], each pointwise inequality is the unique possible morphism with its source and target, so the supplied families are natural transformations.

F1
1.2

At aA, the two sides of the first triangle identity are parallel morphisms F(a)F(a) in the thin category B, hence they are equal.

F1
1.3

At bB, the two sides of the second triangle identity are parallel morphisms G(b)G(b) in the thin category A, hence they are equal.

F1
2.1

Thus both triangle identities hold. Applying this to the inequalities in [L1] proves the final assertion.

step 1.2step 1.3L1
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16Open item page →

Right adjoints preserve every limit that exists

Statement

Let F:CD be left adjoint to G:DC. If a diagram D:JD 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 FG with unit η and counit ε, a diagram D:JD, and a limiting cone λj:LDj.

[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.1

Let μj:cGDj be any cone over GD, and define μˉj:=εDjF(μj):FcDj.

L1construct
2.1

For a:jk 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.

step 1.1L1
3.1

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

step 2.1F1construct
4.1

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.

step 1.1step 3.1L1
4.2

If k:cGL also satisfies G(λj)k=μj, then εLF(k):FcL 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^.

step 1.1step 3.1F1L1
5.1

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.

step 4.1step 4.2F1F2
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16Open item page →

Left adjoints preserve every colimit that exists

Statement

If F:CD is a left adjoint and a diagram D:JC has a colimit, then applying F to a colimiting cocone produces a colimit of FD. Thus left adjoints preserve every colimit that exists.

Facts & Assumptions

Given: An adjunction FG and a diagram in C with a colimit.

[F1]

A formal theorem derived from the category axioms has a formal dual obtained by reversing morphisms and exchanging each notion with its opposite-category version (Every theorem about categories has a formal dual obtained by reversing morphisms and composition).

[F2]

A cocone is colimiting in a category exactly when the reversed family is a limiting cone in the opposite category (A limiting cone for a diagram is exactly a colimiting cocone for the formally dual diagram in the opposite category).

[L1]

Right adjoints preserve every limit that exists (Right adjoints preserve every limit that exists).

Proof

technique · direct
1.1

Passing to opposite categories turns FG into GopFop, so Fop is a right adjoint.

F1
1.2

By [F2], the given colimit in C is a limit in Cop.

F2
2.1

Apply [L1] to Fop: the reversed image cone is limiting in Dop.

step 1.1step 1.2L1
3.1

Translating back with [F2], the image cocone under F is colimiting in D.

step 2.1F2
RemarkRemark: Literature-sourcedProof: Not applicablejudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16Open item page →

The direct preservation theorem carries no size hypothesis

The proof of Right adjoints preserve every limit that exists transposes individual cone legs by explicit unit and counit formulas. It neither collects a hom-class into a set nor forms a Set-valued representable functor. Consequently its statement applies to every legitimate diagram whose limit exists, without assuming local smallness of the categories or smallness of the indexing category. The separate representable proof needs both hypotheses because its chain of hom-set isomorphisms is Set-valued.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16 rests on unproved material (inherited)Open item page →
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.

Under local smallness, representable functors give a second proof that right adjoints preserve small limits

Statement

Let FG:DC be an adjunction between locally small categories. For every small diagram D:JD with a limit, the representable-functor calculation identifies G(limD) as a limit of GD. Equivalently, the canonical comparison

G(limD)lim(GD)

is an isomorphism whenever the displayed chosen limits are supplied.

Facts & Assumptions

Given: The locally small adjunction and small diagram in the Statement.

[F1]

A covariantly representable Set-valued functor on a locally small category preserves every small limit that exists (Every covariantly representable functor to Set preserves all existing small limits).

[F2]

A functor preserves a chosen limit exactly when its canonical comparison to the chosen limit of the image diagram is an isomorphism (A functor preserves a chosen limit exactly when its canonical comparison to the chosen target limit is an isomorphism, and dually for colimits).

[L1]

The adjunction gives natural bijections C(c,Gd)D(Fc,d) (Under local smallness, transposition gives the natural hom-set bijection, and conversely).

Proof

technique · direct
1.1

For every cC, [L1] gives C(c,GlimD)D(Fc,limD).

L1
2.1

By [F1], the right side is naturally isomorphic to limjD(Fc,Dj), since D(Fc,) is representable and J is small.

step 1.1F1
3.1

Applying [L1] componentwise identifies this limit with limjC(c,GDj). The composite is natural in c.

step 2.1L1
4.1

Hence the cone G(limD)GD represents the cone functor and is limiting. If a chosen limit of GD is also supplied, uniqueness of limits makes the canonical comparison an isomorphism, exactly as stated in [F2].

step 3.1F2
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16 rests on unproved material (inherited)Open item page →
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.

Left exact and right exact functors

Definition

A functor is left exact when it preserves every finite limit that exists in its source category, and right exact when it preserves every finite colimit that exists there. Here finite means indexed by a finite category as in Finite, small, and large limits and colimits; complete and cocomplete categories, and preservation has the meaning of Preservation, reflection, and creation of limits and colimits; continuous and cocontinuous functors. These terms assert preservation, not existence, of the relevant limits or colimits.

CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16 rests on unproved material (inherited)Open item page →
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 right adjoint is left exact and a left adjoint is right exact

Statement

Every right adjoint is left exact, and every left adjoint is right exact. The assertion concerns finite limits or colimits that exist in the source category; it does not assert that the source has them.

Facts & Assumptions

Given: An adjunction FG.

[L1]

Right adjoints preserve every limit that exists (Right adjoints preserve every limit that exists).

[L2]

Left adjoints preserve every colimit that exists (Left adjoints preserve every colimit that exists).

[L3]

Left exact means preserving existing finite limits, and right exact means preserving existing finite colimits (Left exact and right exact functors).

Proof

technique · direct
1.1

Applying [L1] to finite indexing categories shows that G preserves every existing finite limit.

L1
1.2

Applying [L2] to finite indexing categories shows that F preserves every existing finite colimit.

L2
2.1

Unfolding [L3], step 1.1 says that G is left exact and step 1.2 says that F is right exact, without adding an existence hypothesis.

step 1.1step 1.2L3
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-16Open item page →

Right adjoints preserve monomorphisms and left adjoints preserve epimorphisms

Statement

Every right adjoint preserves monomorphisms, and every left adjoint preserves epimorphisms.

Facts & Assumptions

Given: A morphism f:xy and an adjunction whose right or left adjoint is applied to it.

[F1]

A morphism f is monic when fg=fh implies g=h for every parallel pair, and epic when gf=hf implies g=h for every parallel pair (Monomorphism and epimorphism by left and right cancellation).

[L1]

Right adjoints preserve every existing limit (Right adjoints preserve every limit that exists).

[L2]

Left adjoints preserve every existing colimit (Left adjoints preserve every colimit that exists).

Proof

technique · direct
1.1

If f is monic, the commutative square with vertex x, both maps into the two copies of x equal to 1x, and both maps from those copies to y equal to f, is a pullback: a pair g,h:zx with fg=fh has the unique mediating map g=h.

F1
1.2

Conversely, if that self-square is a pullback and fg=fh, then both g and h are mediating maps for the same cone, so pullback uniqueness gives g=h; hence f is monic.

F1
2.1

A right adjoint preserves the pullback in step 1.1 by [L1], and step 1.2 then says that the image of f is monic.

step 1.1step 1.2L1
3.1

Passing to opposite categories turns epimorphisms into monomorphisms and a left adjoint into a right adjoint; equivalently, apply [L2] to the dual pushout characterization. Thus left adjoints preserve epimorphisms.

step 2.1L2
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-16 rests on unproved material (inherited)Open item page →
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.

Chosen limits and colimits are adjoint to the diagonal functor

Statement

Let J be small and let Δ:C[J,C] be the diagonal functor.

  1. If a limiting cone is supplied for every D:JC, the resulting limit functor satisfies ΔlimJ.
  2. If a colimiting cocone is supplied for every such D, the resulting colimit functor satisfies colimJΔ.

The choices are part of the hypotheses.

Facts & Assumptions

Given: The small category J and the supplied choices in the Statement.

[F1]

Chosen limiting or colimiting cones for every diagram assemble into limit or colimit functors (Chosen limits and colimits of a fixed small shape assemble into limit and colimit functors).

[F3]

Morphisms in a functor category are natural transformations (Functor category [C,D]).

Proof

technique · direct
1.1

By [F1], the supplied limiting cones define a functor limJ:[J,C]C.

F1
1.2

A morphism climD is, by [F2], uniquely equivalent to a cone from c to D; by [F3], such a cone is exactly a natural transformation ΔcD.

F2F3
1.3

Dually, supplied colimits assemble by [F1], and [F2] with [F3] make a morphism colimDc uniquely equivalent to a cocone DΔc.

F1F2F3
2.1

The correspondence in step 1.2 is natural in c and D because postcomposition of a mediating map and transport of a cone along a natural transformation preserve the defining cone equations. Hence ΔlimJ.

step 1.1step 1.2
3.1

Reading step 2.1 in the opposite categories gives the corresponding check for step 1.3: the cocone correspondence is natural in c and D because precomposition of a mediating map and transport of a cocone along a natural transformation preserve the defining cocone equations. Hence colimJΔ.

step 1.3step 2.1F2F3
4.1

Both constructions begin with supplied objectwise choices; no selection is inferred from bare existence.

step 2.1step 3.1
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-16Open item page →

Direct image, preimage, and universal image form an adjoint triple on power sets

Statement

For a function f:AB, order the power sets by inclusion and define

f!(S):=f[S],f1(T):={aA:f(a)T},

f(S):={bB:f1[{b}]S}.

Then

f!f1f.

Thus direct image is left adjoint to preimage, and universal image is right adjoint to preimage. The notation f here always denotes universal image.

Facts & Assumptions

Given: A function f:AB, subsets SA and TB.

[F1]

For a relation, image and preimage are R[A]={b:aA ((a,b)R)} and R1[B]={a:bB ((a,b)R)} (The image R[A] and the preimage R1[B] of a set under a relation).

[L1]

For posets, an adjunction is a Galois connection: P(x)y if and only if xQ(y) (Galois connection between preorders).

Proof

technique · direct
1.1

By [F1], f[S]T means that every aS satisfies f(a)T, which is equivalent to Sf1[T].

F1
1.2

The inclusion f1[T]S means that whenever bT, every a in the fibre f1[{b}] lies in S; this is equivalent to Tf(S).

F1
2.1

Step 1.2 also covers an empty fibre, because the empty set is a subset of every S; hence no surjectivity hypothesis on f is present.

step 1.2
3.1

Applying [L1] to steps 1.1 and 1.2 gives f!f1 and f1f, respectively.

step 1.1step 1.2L1
RemarkRemark: AI-adaptedProof: Not applicableaudited 2026-08-16Open item page →

The image-preimage adjunctions explain the set-operation preservation laws

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-16Open item page →

The free-group functor is left adjoint to the underlying-set functor

Statement

Choosing a free group (F(X),iX) on every set X defines a functor F:SetGrp, and

FU:GrpSet,

where U is the underlying-set functor. The adjunction bijection sends a group homomorphism φ:F(X)G to the function U(φ)iX:XU(G).

Facts & Assumptions

Given: A chosen free group (F(X),iX) for every set X.

[F1]

A free group on X has the property that every function u:XG extends uniquely to a homomorphism u^:F(X)G with u^iX=u (Free group on a set of generators).

[F2]

Two free groups on the same set are uniquely isomorphic by an isomorphism preserving the generator maps (Free groups on the same set are uniquely isomorphic compatibly with their generators).

[F3]

Groups and group homomorphisms form the locally small category Grp (Groups and group homomorphisms form the large locally small category Grp).

[L1]

Chosen objectwise universal arrows assemble uniquely into a left adjoint (Chosen objectwise universal arrows assemble uniquely into a left adjoint).

Proof

technique · direct
1.1

For a function a:XY, apply [F1] to iYa:XF(Y) and define F(a) as its unique extending homomorphism.

F1construct
1.2

For each G, restriction along iX and extension by [F1] are inverse maps between Grp(F(X),G) and Set(X,U(G)).

F1F3
2.1

Uniqueness in [F1] gives F(1X)=1F(X) and F(ba)=F(b)F(a), since both sides agree with the relevant generator map. Thus F is a functor and i:1SetUF is natural.

step 1.1F1
3.1

Equivalently, (F(X),iX) is a universal arrow from X to U, so [L1] gives FU and the asserted natural bijection.

step 1.1step 2.1step 1.2L1
4.1

For X=, [F1] says F(X) is initial in Grp, so the same construction applies. By [F2], replacing any chosen free-group model changes F(X) only by the unique generator-preserving isomorphism.

F1F2
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16Open item page →

The free-module functor is left adjoint to the underlying-set functor

Statement

Fix a unital ring R. The assignment XR(X) extends to a functor from sets to left R-modules, and it is left adjoint to the underlying-set functor

R()U:R-ModSet.

The natural bijection sends an R-linear map T:R(X)M to the function xT(ex).

Facts & Assumptions

Given: A unital ring R, a set X, and a left R-module M.

[F1]

Every function u:XM extends uniquely to an R-linear map uˉ:R(X)M with uˉ(ex)=u(x) (Universal property of the free module on a set).

[F2]

Left R-modules and module homomorphisms form the locally small category R-Mod (Left modules over a fixed ring and module homomorphisms form the large locally small category R-Mod).

[L1]

Chosen objectwise universal arrows assemble uniquely into a left adjoint (Chosen objectwise universal arrows assemble uniquely into a left adjoint).

Proof

technique · direct
1.1

For a function a:XY, define R(a):R(X)R(Y) as the unique linear map sending ex to ea(x).

F1construct
1.2

Restricting a linear map to the standard basis and extending a function by [F1] are inverse operations, naturally in X and M.

F1F2
2.1

Uniqueness in [F1] gives R(1X)=1 and R(ba)=R(b)R(a), so this is a functor and the basis inclusions are natural.

step 1.1F1
3.1

Thus the standard-basis map is a universal arrow from X to U, and [L1] gives the asserted adjunction.

step 1.1step 2.1step 1.2L1
4.1

When X=, R(X) is the zero module and [F1] gives the unique map from it to every R-module, so no separate nonempty-basis hypothesis is required.

F1
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-16Open item page →

Finite words satisfy the free-monoid universal property

Statement

For a set X, let

X:=nNXn

be the set of finite words in letters from X, where Xn is the set of functions nX. With concatenation and the empty word, X is a monoid. The one-letter map iX:XX has the universal property that every function u:XM into a monoid extends uniquely to a monoid homomorphism u^:XM.

Facts & Assumptions

Given: A set X, a monoid (M,,e), and a function u:XM.

[F1]

A monoid is a set with an associative binary operation and a two-sided identity (Semigroup and monoid).

[F2]

A finite product in a monoid is uniquely defined by the recursion P(0)=e and P(n+1)=P(n)gn (The product g0g1gn1 of a finite list in a monoid, by recursion, with the empty product (n=0) equal to the identity).

[F3]

The natural numbers form the smallest inductive set (The natural numbers N (von Neumann)).

[F4]

Natural addition satisfies n+0=n and n+(m+1)=(n+m)+1 (Addition of natural numbers).

[F5]

Natural addition is associative: (n+m)+r=n+(m+r) (Addition is associative).

[F6]

For sets A,B, the functions AB form a set (The set BA of all functions AB).

[F7]

The indexed union of a family (Ai)iI is iIAi={Ai:iI} (iIAi:={Ai:iI}, and iIAi:={Ai:iI} for I).

[F8]

If a property holds at 0 and passes from n to n+1, it holds for every natural number (The principle of mathematical induction).

Proof

technique · direct
1.1

Each Xn is a set by [F6], and [F3] and [F7] make their indexed union X a set. The unique function 0X is the empty word.

F3F6F7
1.2

For p:nX and q:mX, define pq:n+mX by using p on the first n positions and q on the following m positions.

F4construct
1.3

For a word p:nX, define u^(p) as the finite product u(p(0))u(p(n1)), with value e when n=0.

F2construct
2.1

Function extensionality and [F5] show (pq)r=p(qr); the equations in [F4] show that the empty word is a two-sided identity. Thus X is a monoid by [F1].

step 1.1step 1.2F1F4F5
2.2

Induction on the length of the second word, using [F2] and associativity in M, proves u^(pq)=u^(p)u^(q). Hence u^ is a monoid homomorphism and extends u on one-letter words.

step 1.2step 1.3F1F2F8
3.1

If T:XM is any homomorphism extending u, induction on word length gives T(p)=u(p(0))u(p(n1))=u^(p); the base case uses the empty word and the identity of M.

step 2.1step 1.3F1F8
4.1

Thus the extension exists and is unique for every u, including X=, where X contains only the empty word.

step 2.2step 3.1
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16Open item page →

The free-monoid functor is left adjoint to the underlying-set functor

Statement

The assignment XX of the finite-word monoid extends to a functor ():SetMon and is left adjoint to the underlying-set functor U:MonSet.

Facts & Assumptions

Given: A set X and its finite-word monoid X.

[L1]

The one-letter map iX:XX is universal: every function XU(M) extends uniquely to a monoid homomorphism XM (Finite words satisfy the free-monoid universal property).

[L2]

Chosen objectwise universal arrows assemble uniquely into a left adjoint (Chosen objectwise universal arrows assemble uniquely into a left adjoint).

Proof

technique · direct
1.1

For a function a:XY, let a:XY be the unique monoid homomorphism extending the one-letter function iYa.

L1construct
1.2

Restriction to letters and the extension in [L1] are inverse, naturally identifying monoid homomorphisms XM with functions XU(M).

L1
2.1

Uniqueness in [L1] gives (1X)=1X and (ba)=ba, since each pair agrees on all one-letter words. Thus () is a functor and iX is natural.

step 1.1L1
3.1

Therefore (X,iX) is a universal arrow from X to U, and [L2] gives ()U, including the empty-set case.

step 1.1step 2.1step 1.2L2
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-16Open item page →

Abelianisation is left adjoint to the inclusion of abelian groups

Statement

Abelianisation defines a functor ()ab:GrpAb, and it is left adjoint to the inclusion I:AbGrp. Explicitly, every homomorphism f:GI(A) with A abelian factors uniquely through the quotient qG:GGab.

Facts & Assumptions

Given: A group G, an abelian group A, and a homomorphism f:GA.

[F1]

The abelianisation of G is Gab:=G/[G,G] (The abelianisation Gab:=G/[G,G] and its canonical map).

[F2]

For g,hG, their commutator is [g,h]:=ghg1h1, and [G,G] is generated by all commutators (Commutators [g,h]=ghg1h1 and the commutator subgroup [G,G]).

[F3]

A homomorphism that kills a normal subgroup factors uniquely through the quotient group (A homomorphism that kills a normal subgroup factors uniquely through the quotient group).

[L1]

Chosen objectwise universal arrows assemble uniquely into a left adjoint (Chosen objectwise universal arrows assemble uniquely into a left adjoint).

Proof

technique · direct
1.1

Since A is abelian, f([g,h])=f(g)f(h)f(g)1f(h)1=1A for all g,hG, so [G,G]kerf.

F2algebra
1.2

The group Gab is abelian: qG has kernel [G,G] by [F1], so for g,hG the commutator qG(g)qG(h)qG(g)1qG(h)1=qG([g,h]) is trivial by [F2], and qG is surjective.

F1F2algebra
2.1

By [F3], there is a unique homomorphism fˉ:GabA with fˉqG=f.

step 1.1F1F3
3.1

For a homomorphism a:GH, the target Hab is abelian by step 1.2, so step 2.1 applies to qHa:GHab; define aab as its unique factor through qG.

step 1.2step 2.1construct
4.1

Uniqueness in [F3] gives (1G)ab=1 and (ba)ab=babaab, so abelianisation is a functor and q is natural.

step 3.1F3
5.1

Step 2.1 is the universal-arrow property of (Gab,qG) from G to the inclusion I; [L1] therefore gives ()abI.

step 2.1step 4.1L1
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-16Open item page →

Discrete topology, underlying set, and indiscrete topology form an adjoint triple

Statement

Let D,I:SetTop equip a set with the discrete and indiscrete topology, respectively, and let U:TopSet forget the topology. Then

DUI.

Facts & Assumptions

Given: A set X and a topological space Y.

[F1]

The discrete topology on a set is its power set, and the indiscrete topology is {,X} (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies).

[F2]

A map f is continuous when it is continuous at every point, and f is continuous at x exactly when for every open VY with f(x)V there is an open UX with xU and f[U]V (Continuity of a map of topological spaces at a point and globally).

[F3]

Sets and functions form the locally small category Set (Sets and functions form the large locally small category Set).

[F4]

Topological spaces and continuous maps form the locally small category Top (Topological spaces and continuous maps form the large locally small category Top).

[L1]

An adjoint triple consists of adjunctions on both sides of its middle functor (Adjoint triple LMR).

Proof

technique · direct
1.1

Every function f:XUY is continuous as a map D(X)Y: given xX and an open Vf(x) in Y, the singleton U={x} is open in the discrete topology by [F1] and satisfies f[U]V, so [F2] gives continuity at x and hence continuity. Thus the identity-on-functions correspondence gives Top(DX,Y)Set(X,UY).

F1F2F3F4
1.2

Every function g:UYX is continuous as a map YI(X): by [F1] the only open sets of I(X) are and X, so an open V containing g(y) must be X, and U=Y is open with g[U]X; [F2] again gives continuity. Thus Set(UY,X)Top(Y,IX).

F1F2F3F4
2.1

Both correspondences are natural because precomposition and postcomposition leave the underlying function unchanged. Therefore DU and UI.

step 1.1step 1.2
3.1

By [L1] these adjunctions form the displayed triple. The same proof includes the empty set and singleton, whose discrete and indiscrete topologies may coincide.

step 2.1L1
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-16Open item page →

Under the ultrafilter lemma and dependent choice, Stone-Cech compactification is left adjoint to the compact-Hausdorff inclusion

Statement

Assume the ultrafilter lemma and dependent choice. On the category of Tychonoff spaces, chosen Stone–Čech compactifications define a functor β left adjoint to the full inclusion

J:CompHausTych.

For each Tychonoff space X, the unit is its compactification map ηX:XJβX.

Facts & Assumptions

Given: The ultrafilter lemma and dependent choice, and a chosen Stone–Čech compactification (βX,ηX) for every Tychonoff space X.

[F1]

A Stone–Čech compactification (B,i) of X has the property that every continuous map XK to a compact Hausdorff space extends uniquely to a continuous map BK (The Stone–Čech compactification by its compact-Hausdorff extension property).

[F2]

Under the ultrafilter lemma and dependent choice, the evaluation-closure construction is a Stone–Čech compactification of every Tychonoff space (Under the ultrafilter lemma and dependent choice, the closure of the full evaluation image is the Stone–Čech compactification).

[F3]

Under dependent choice, every compact Hausdorff space embeds in a cube [0,1]J for some set J (Under dependent choice, every compact Hausdorff space embeds in a unit cube).

[F4]

A full subcategory contains all ambient morphisms between its objects (Subcategory and full subcategory).

[L1]

Chosen objectwise universal arrows assemble uniquely into a left adjoint (Chosen objectwise universal arrows assemble uniquely into a left adjoint).

Proof

technique · direct
1.1

By [F5] every compact Hausdorff space is Tychonoff, so [F4] makes J:CompHausTych a well-defined full inclusion; [F3] is what supplies the embedding used inside [F2]. The hypotheses in [F2] supply (βX,ηX), and [F1] says precisely that it is a universal arrow from X to J.

F1F2F3F4F5
1.2

For a continuous map a:XY, apply [F1] to ηYa:XβY and define βa:βXβY as its unique extension.

F1construct
2.1

Extension uniqueness gives β(1X)=1βX and β(ba)=β(b)β(a), and the defining equations make η natural.

step 1.2F1
3.1

Thus the chosen universal arrows assemble by [L1] into βJ. The assumptions are exactly those used in [F2] and [F3]; the assembly step adds no choice principle.

step 1.1step 2.1L1F2F3
PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-16Open item page →

The underlying-set functor on fields has no left adjoint

Statement

The underlying-set functor U:FieldSet has no left adjoint, where field homomorphisms preserve 1.

Facts & Assumptions

Given: The category of fields and unital field homomorphisms.

[F1]

A field has 01, is an abelian group under addition, has associative commutative multiplication with unit and inverses for nonzero elements, and satisfies distributivity (Field).

[F2]

A field homomorphism satisfies φ(x+y)=φ(x)+φ(y), φ(xy)=φ(x)φ(y), and φ(1F)=1G, and is automatically injective because its kernel is an ideal of a field and does not contain 1F (Field homomorphism and embedding).

[F3]

The characteristic of a unital ring is the least positive natural n with n1R=0R, if such an n exists, and is 0 otherwise (The characteristic of a ring: the least n1 with n1R=0 when one exists, and 0 otherwise).

[F4]
[L1]

If FU, then Field(F(X),K)Set(X,U(K)) naturally (Under local smallness, transposition gives the natural hom-set bijection, and conversely).

Proof

technique · contradiction
1.1

Suppose, for contradiction, that a left adjoint F to U exists.

assume-contra
1.2

Taking X= in [L1], the right hom-set is a singleton for every field K, so there is exactly one field homomorphism F()K; hence F() is an initial field.

L1
1.3

Let φ:KL be a field homomorphism. By [F2] it sends n1K to n1L for every natural n and is injective. If charK=p>0 then p1L=φ(p1K)=φ(0)=0; dividing p by charL with remainder and using the minimality in [F3] shows charL divides p, and charL=1 is impossible because 01 in [F1], so charL=p. If charK=0 then n1K0 for every n1, so injectivity gives n1L0 and charL=0. Thus a field homomorphism preserves characteristic exactly.

F1F2F3
2.1

In Z/p the element n1 is the class of n, which vanishes exactly when pn, so [F3] and [F4] give charF2=2 and charF3=3. The initial field would have homomorphisms to both, and step 1.3 would force its characteristic to equal 2 and to equal 3.

step 1.2step 1.3F3F4
3.1

The contradiction shows that U has no left adjoint.

step 2.1discharge-contradiction
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-16Open item page →

Coextension of scalars HomR(S,M) carries its canonical left S-module structure

Statement

Let φ:RS be a unital ring homomorphism and let M be a left R-module. Regard S as a left R-module by rt=φ(r)t. Then HomR(S,M) is a left S-module under

(sh)(t):=h(ts).

For an R-linear map u:MM, postcomposition huh is S-linear, so this construction is functorial in M.

Facts & Assumptions

Given: A unital ring homomorphism φ:RS, a left R-module M, elements rR, s,sS, and h,hHomR(S,M).

[F1]

A ring homomorphism preserves addition, multiplication, zero, and one (Ring homomorphism: additive, multiplicative, and required to send 1 to 1).

[F2]

A left module action satisfies distributivity, (rs)m=r(sm), and 1Rm=m (Unital left and right modules over a ring; unqualified module means left module).

[F3]

An R-linear map satisfies h(x+y)=h(x)+h(y) and h(rx)=rh(x) (Module homomorphism and isomorphism, kernel, image and cokernel).

[F4]

The functions from one set to another form a set (The set BA of all functions AB).

Proof

technique · direct
1.1

The set HomR(S,M) is a subset of the function set MS, which exists by [F4].

F4
1.2

For rR and tS, (sh)(φ(r)t)=h(φ(r)ts)=rh(ts)=r(sh)(t), and additivity is similar, so sh is R-linear.

F1F3algebra
1.3

Pointwise, ((ss)h)(t)=h(tss)=(s(sh))(t) and (1Sh)(t)=h(t), so associativity and the unit law hold.

F1F2algebra
1.4

Pointwise additivity of h gives ((s+s)h)(t)=(sh+sh)(t), and linearity in h gives (s(h+h))(t)=(sh+sh)(t).

F3algebra
2.1

Steps 1.1 through 1.4 verify all left S-module axioms in [F2].

step 1.1step 1.2step 1.3step 1.4F2
3.1

If u:MM is R-linear, then uh is R-linear and u((sh)(t))=u(h(ts))=(s(uh))(t), so postcomposition is S-linear. Identities and composites are preserved by associativity of function composition.

F3step 1.2
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16Open item page →

Coextension of scalars is right adjoint to restriction of scalars

Statement

For a unital ring homomorphism φ:RS, restriction of scalars

Res:S-ModR-Mod

is left adjoint to coextension of scalars

Coind(M):=HomR(S,M).

Naturally in an S-module N and an R-module M,

HomS(N,HomR(S,M))HomR(ResN,M).

Facts & Assumptions

Given: The ring homomorphism φ:RS, a left S-module N, and a left R-module M.

[L1]

On HomR(S,M) the canonical left S-action is (sh)(t)=h(ts) (Coextension of scalars HomR(S,M) carries its canonical left S-module structure).

[F1]

Left modules and module homomorphisms form locally small categories (Left modules over a fixed ring and module homomorphisms form the large locally small category R-Mod).

[L2]

A natural family of hom-set bijections determines an adjunction (Under local smallness, transposition gives the natural hom-set bijection, and conversely).

Proof

technique · direct
1.1

Given an S-linear map α:NHomR(S,M), define E(α):ResNM by E(α)(n)=α(n)(1S). It is R-linear because α(φ(r)n)=φ(r)α(n) and [L1] gives (φ(r)α(n))(1)=α(n)(φ(r))=rα(n)(1).

L1algebra
1.2

Given an R-linear map u:ResNM, define C(u)(n)(s):=u(sn). For rR, C(u)(n)(φ(r)s)=u(φ(r)sn)=ru(sn), so C(u)(n) is R-linear.

constructalgebra
2.1

For a,sS, C(u)(an)(s)=u(san)=C(u)(n)(sa)=(aC(u)(n))(s) by [L1], so C(u) is S-linear.

step 1.2L1
2.2

Evaluation gives E(C(u))(n)=C(u)(n)(1)=u(n). Conversely, S-linearity of α gives C(E(α))(n)(s)=E(α)(sn)=α(sn)(1)=(sα(n))(1)=α(n)(s).

step 1.1step 1.2L1
3.1

Thus E and C are inverse bijections. Precomposition in N and postcomposition in M commute with the two displayed formulas, so the bijections are natural.

step 2.1step 2.2F1
4.1

By [L2], these natural bijections define ResCoind. No tensor-product or extension-of-scalars construction is used.

step 3.1L2
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-16Open item page →

Currying gives the adjunction ×A()A in Set

Statement

For every set A, the product functor ×A:SetSet is left adjoint to the function-set functor ()A. Naturally in X and Y,

Set(X×A,Y)Set(X,YA).

The bijection sends h to h^(x)(a)=h(x,a) and sends k to kˇ(x,a)=k(x)(a).

Facts & Assumptions

Given: Sets A,X,Y.

[F1]

The functions AY form the set YA (The set BA of all functions AB).

[F3]

The cartesian product X×A consists of ordered pairs (x,a) with xX, aA (The Cartesian product A×B:={zP(P(AB)):aA bB z=(a,b)}).

[F4]

Sets and functions form the locally small category Set (Sets and functions form the large locally small category Set).

Proof

technique · direct
1.1

For h:X×AY, define h^:XYA by h^(x)(a)=h(x,a); [F1] and [F3] make this a well-defined function.

F1F3construct
1.2

For k:XYA, define kˇ:X×AY by kˇ(x,a)=k(x)(a).

F1F3construct
2.1

For all (x,a), h^ˇ(x,a)=h(x,a), so function extensionality gives h^ˇ=h; similarly kˇ^(x)(a)=k(x)(a) gives kˇ^=k.

step 1.1step 1.2F2
2.2

Precomposition in X and postcomposition in Y commute with evaluation at (x,a), so the bijection is natural in both variables.

step 1.1step 1.2algebra
3.1

Since Set is locally small by [F4], [L1] applies and gives ×A()A. The formulas also cover A= without exception.

step 2.1step 2.2F4L1
False statementConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16Open item page →

A unit and counit determine an adjunction without the triangle identities

Statement

If functors F:CD and G:DC admit natural transformations η:1CGF and ε:FG1D, then FG even when the triangle identities have not been checked.

Facts & Assumptions

Given: The two-element group C2={1,z} with z2=1.

[F1]

Every monoid is a one-object category, and it is a group exactly when every morphism in that category is invertible (A monoid is a one-object category, and a group is a one-object category in which every morphism is invertible).

[F2]

An adjunction requires natural transformations η and ε satisfying (εF)(Fη)=1F and (Gε)(ηG)=1G (Adjunction by unit, counit, and the triangle identities).

Refutation

technique · direct
1.1

Regard C2 as the one-object category C supplied by [F1], and take F=G=1C.

F1construct
2.1

Let the sole component of η be 1 and the sole component of ε be z. Both are natural because C2 is abelian, so each component commutes with every morphism.

step 1.1algebra
3.1

Each triangle composite is z1=z, which is not the identity morphism 1. Thus the data fail both identities in [F2] and do not form an adjunction.

step 2.1F2algebra
False statementConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16Open item page →

Left adjoints preserve limits

Statement

Every left adjoint preserves all limits that exist.

Facts & Assumptions

Given: The free-group functor F:SetGrp.

[F1]

The functor F is left adjoint to the underlying-set functor U:GrpSet (The free-group functor is left adjoint to the underlying-set functor).

[F2]

The reduced words on XX1 form the free group on X, with each xX represented by a one-letter word (Reduced words form the free group on an alphabet).

[F3]

A terminal object admits exactly one morphism from every object, hence exactly one endomorphism (Initial object, terminal object, and zero object).

Refutation

technique · direct
1.1

A singleton 1={x} is terminal in Set. By [F2], F(1) contains the distinct empty word and one-letter word x, so its identity homomorphism differs from its trivial endomorphism.

F2algebra
2.1

Therefore F(1) is not terminal by [F3], although F is a left adjoint by [F1]. The terminal-object limit is not preserved, so the statement is false.

step 1.1F1F3
False statementConstruction: AI-adaptedVerification: AI-adaptedprecheck passaudited 2026-08-16Open item page →

Every functor with a left adjoint also has a right adjoint

Statement

If a functor has a left adjoint, then it also has a right adjoint.

Facts & Assumptions

Given: The underlying-set functor U:GrpSet.

[F1]

The free-group functor is a left adjoint of U (The free-group functor is left adjoint to the underlying-set functor).

[F2]

Every left adjoint preserves colimits, including initial objects (Left adjoints preserve every colimit that exists).

[F3]

An initial object has exactly one morphism to every object (Initial object, terminal object, and zero object).

Refutation

technique · contradiction
1.1

By [F1], U has a left adjoint. Suppose, as the claim predicts, that U also has a right adjoint. Then U itself is a left adjoint and preserves initial objects by [F2].

F1F2assume-contra
1.2

The trivial group is initial in Grp, since there is exactly one homomorphism from it to every group. Its underlying set is a singleton.

F3algebra
2.1

The empty set, not a singleton, is initial in Set, so step 1.2 contradicts the preservation conclusion of step 1.1. Hence U has no right adjoint and the statement is false.

step 1.1step 1.2F3discharge-contradiction
False statementConstruction: AI-adaptedVerification: AI-adaptedprecheck passaudited 2026-08-16Open item page →

The hom-set form of an adjunction needs no size hypothesis

Statement

The hom-set formulation D(Fc,d)C(c,Gd) of an adjunction is meaningful without any local-smallness hypothesis.

Facts & Assumptions

Given: The class Ord of all ordinals.

[F1]

A category is locally small exactly when every hom-class is a set; a large category may still be locally small (Small, locally small, and large categories).

[F2]

Ordinal addition is specified by α+0=α, α+(β+1)=(α+β)+1, and α+λ=β<λ(α+β) for nonzero limit λ (Ordinal addition α+β).

[F3]

Ordinal addition is associative: (α+β)+γ=α+(β+γ) for all ordinals α,β,γ (Ordinal addition is associative).

[F4]

The ordinals form a proper class: no set contains every ordinal (Burali-Forti: there is no set of all ordinals).

[L1]

An adjunction is specified by functors, a unit, a counit, and the two triangle identities, without a hom-set hypothesis (Adjunction by unit, counit, and the triangle identities).

Refutation

technique · direct
1.1

Form a one-object category O whose endomorphism class is Ord, whose identity is 0, and whose composition is ordinal addition. The zero clause in [F2] gives α+0=α directly. The other identity law 0+α=α needs all three clauses and transfinite induction on α: the zero clause gives 0+0=0; the successor clause gives 0+(β+1)=(0+β)+1=β+1 from the inductive hypothesis; and for a nonzero limit λ the limit clause gives 0+λ=β<λ(0+β)=β<λβ=λ. Associativity is [F3].

F2F3inductionconstruct
2.1

Its only hom-class is the proper class Ord by [F4], so O is not locally small by [F1]. Consequently O(,) is not a hom-set and cannot be an object of Set.

step 1.1F1F4
3.1

Thus a Set-valued hom-set bijection is not even meaningful in this example, whereas [L1] explains why unit-counit data remain the size-free formulation. The statement is false.

step 2.1L1

5 · Examples, counterexamples and false statements

None yet.

Sources

Standard references

Recommended treatments; not extraction sources.