Alphabeta Math
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.

✓ 25 results · all verified · 15 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 10 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Closed Monoidal Categories and the Internal Hom

1 · Prerequisites

2 · Summary

This page keeps three boundaries explicit. Closedness is extra structure on a monoidal category, not a default consequence of having a tensor product; in a non-symmetric setting the left and right closures are different constructions; and the subobject-classifier block stops at the classifier and its represented subobject functor, without turning the page into a topos survey.

The positive spine runs from biclosed monoidal categories to cartesian closed categories, locally cartesian closed categories, and the basic classifier examples in Set and presheaf categories. The companion examples page computes the adjunctions and classifiers on small concrete inputs.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-01Open item page →

Left-closed, right-closed, and biclosed monoidal categories

Definition

Let (C,⊗,1) be a monoidal category (Monoidal category).

  • It is right closed when for every object X the functor −⊗X:C→C has a right adjoint in the sense of Adjunction by unit, counit, and the triangle identities. A chosen right adjoint is written [X,−].
  • It is left closed when for every object X the functor X⊗−:C→C has a right adjoint. A chosen right adjoint is written ⟨X,−⟩.
  • It is biclosed when it is both left closed and right closed.

Thus a right-closed structure gives natural bijections

C(A⊗X,Y)≅C(A,[X,Y]),

and a left-closed structure gives natural bijections

C(X⊗A,Y)≅C(A,⟨X,Y⟩).

This page keeps the two closures separate unless a symmetry is supplied later.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-01Open item page →

The internal hom is unique up to a unique adjunction-compatible natural isomorphism

Statement

Fix an object X in a monoidal category. Any two chosen right adjoints to −⊗X are related by a unique natural isomorphism compatible with their adjunction units and counits, and the analogous assertion holds for two chosen right adjoints to X⊗−. Hence each internal-hom construction, together with its adjunction data, is unique up to a unique adjunction-compatible natural isomorphism.

Facts & Assumptions

Given: An object X in a monoidal category, together with two chosen right adjoints to −⊗X or two chosen right adjoints to X⊗−.

[L1]

Right-closed and left-closed mean exactly that the corresponding tensor functor has a right adjoint (Left-closed, right-closed, and biclosed monoidal categories).

[L2]

Two right adjoints to the same functor are uniquely naturally isomorphic in a way compatible with the adjunction data (Adjoints are unique up to a unique natural isomorphism compatible with the adjunction data).

Proof

technique · direct
1.1givenL2

If R,R′:C→C are two chosen right adjoints to −⊗X, then they are two right adjoints to the same functor. By [L2] there is a unique natural isomorphism R⇒R′ compatible with the adjunction units and counits.

2.1step 1.1L1

By [L1], a right internal hom in the variable X is precisely such a right adjoint R=[X,−]. Therefore any two choices of [X,−], equipped with their adjunction data, are related by the unique natural isomorphism compatible with those units and counits.

2.2step 1.1L1L2

The same argument with the functor X⊗− proves the corresponding adjunction-compatible uniqueness for the left internal hom ⟨X,−⟩.

3.1step 2.1step 2.2∎

So both internal-hom constructions, with their adjunction data fixed, are unique up to a unique compatible natural isomorphism.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-01Open item page →

The internal hom and its evaluation morphism

Definition

Assume C is right closed. For objects X,Y, the right internal hom [X,Y] is the value at Y of the chosen right adjoint [X,−] to −⊗X (Left-closed, right-closed, and biclosed monoidal categories).

The evaluation morphism

ev⁡X,Y:[X,Y]⊗X→Y

is the counit component at Y of the adjunction −⊗X⊣[X,−]. For every object A, the adjunction yields the transposition bijection

C(A⊗X,Y)≅C(A,[X,Y]),

which sends a morphism u:A⊗X→Y to its adjunct u♭:A→[X,Y] and sends v:A→[X,Y] to its inverse transpose v♯:A⊗X→Y in the sense of Adjuncts and transposition under an adjunction.

If C is left closed, the left internal hom ⟨X,Y⟩ and its evaluation map

ev⁡~X,Y:X⊗⟨X,Y⟩→Y

are defined dually from the adjunction X⊗−⊣⟨X,−⟩.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-01Open item page →

A supplied symmetry identifies the left and right internal homs

Statement

Let C be a monoidal category, fix an object X, and suppose there is a natural isomorphism

σA:A⊗X⟶≅X⊗A

natural in A (Natural isomorphism). If −⊗X has a right adjoint [X,−], then X⊗− has a right adjoint uniquely naturally isomorphic to [X,−]. In particular, in a symmetric monoidal category the left and right internal homs of X agree up to unique natural isomorphism.

Facts & Assumptions

Given: A monoidal category, an object X, a natural isomorphism σA:A⊗X≅X⊗A, and a chosen right adjoint [X,−] to −⊗X.

[L1]

The evaluation-transpose bijection for [X,−] is C(A⊗X,Y)≅C(A,[X,Y]) (The internal hom and its evaluation morphism).

[L2]

Right adjoints to a fixed functor are unique up to unique natural isomorphism (The internal hom is unique up to a unique adjunction-compatible natural isomorphism).

[L3]

A natural isomorphism is, in particular, a natural family of isomorphisms (Natural isomorphism).

Proof

technique · direct
1.1givenL1L3algebra

For each A,Y, compose the bijection of [L1] with precomposition by σA−1:X⊗A→A⊗X. This gives a natural bijection C(X⊗A,Y)≅C(A,[X,Y]).

2.1step 1.1given

The bijection in step 1.1 says exactly that [X,−] is also a right adjoint to the functor X⊗−. Hence a left internal hom for X exists and may be chosen to be [X,−].

3.1step 2.1L2∎

Any other chosen right adjoint to X⊗− is uniquely naturally isomorphic to [X,−] by [L2]. Therefore the supplied symmetry identifies the left and right internal homs, and a genuine symmetric monoidal structure gives this conclusion for every X.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-01Open item page →

In a biclosed monoidal category tensor is cocontinuous in each variable

Statement

Let C be a biclosed monoidal category. For every object X, the functors −⊗X and X⊗− preserve every colimit that exists in C.

Facts & Assumptions

Given: A biclosed monoidal category C and an object X.

[L1]

Biclosed means that −⊗X and X⊗− are left adjoints for every X (Left-closed, right-closed, and biclosed monoidal categories).

[L2]

Every left adjoint preserves all colimits that exist in its domain (Left adjoints preserve every colimit that exists).

Proof

technique · direct
1.1givenL1

Since C is biclosed, the functor −⊗X has a right adjoint and is therefore a left adjoint by [L1].

1.2givenL1

Likewise X⊗− has a right adjoint and is a left adjoint.

2.1step 1.1L2

Apply [L2] to step 1.1 to conclude that −⊗X preserves every colimit that exists in C.

2.2step 1.2L2

Apply [L2] to step 1.2 to conclude that X⊗− preserves every colimit that exists in C.

3.1step 2.1step 2.2∎

Hence tensoring with a fixed object is cocontinuous in each variable.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-01Open item page →

The internal hom preserves limits in the covariant variable and sends colimits to limits in the contravariant variable

Statement

In a biclosed monoidal category, for each fixed object X the functor [X,−] preserves all limits that exist. For each fixed object Y, the contravariant functor [−,Y]:Cop→C preserves limits in Cop; equivalently, it sends colimits in C to limits in C.

Facts & Assumptions

Given: A biclosed monoidal category.

[L1]

For each fixed X, the right internal hom [X,−] is right adjoint to −⊗X (The internal hom and its evaluation morphism).

[L2]

Right adjoints preserve all limits that exist in their domain (Right adjoints preserve every limit that exists).

[L3]

In a biclosed monoidal category, tensoring with a fixed object preserves every colimit that exists (In a biclosed monoidal category tensor is cocontinuous in each variable).

Proof

technique · direct
1.1givenL1L2

Fix X. By [L1], the functor [X,−] is a right adjoint, so [L2] implies that it preserves every limit that exists in C.

1.2

Fix Y. For a morphism u:X′→X, define [u,Y]:[X,Y]→[X′,Y] to be the transpose of

[X,Y]⊗X′→1⊗u[X,Y]⊗X→ev⁡X,YY.

The transposition bijection of [L1] makes this assignment contravariantly functorial in X. [given, L1, construct]

2.1givenstep 1.2L3algebra

Let (ij:Xj→X) be a colimit cocone in C, and fix an object A. By [L3], the functor A⊗− preserves this colimit, so maps A⊗X→Y are naturally the same as compatible families of maps A⊗Xj→Y.

3.1step 1.2step 2.1L1algebra

Apply the transposition bijection of [L1] to the maps in step 2.1. A map A⊗X→Y is the same as a map A→[X,Y], and a compatible family A⊗Xj→Y is the same as a compatible family A→[Xj,Y] with respect to the morphisms [ij,Y] from step 1.2. Therefore maps A→[X,Y] are naturally in bijection with cones from A to the diagram j↦[Xj,Y], so [X,Y] is a limit of that diagram.

4.1step 1.1step 3.1algebra∎

Hence the contravariant functor [−,Y]:Cop→C sends colimits in C to limits in C, equivalently preserves limits in Cop. Combining this with step 1.1 proves the claim.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-01Open item page →

The internal-hom composition morphism

Statement

In a right-closed monoidal category there is a natural morphism

comp⁡X,Y,Z:[Y,Z]⊗[X,Y]→[X,Z]

obtained by transposing the double evaluation map. For every object X there is also a unit morphism

uX:1→[X,X],

and these satisfy the associativity and unit laws for composition.

Facts & Assumptions

Given: A right-closed monoidal category.

[L1]

The evaluation morphism ev⁡X,Y:[X,Y]⊗X→Y and the transpose bijection C(A⊗X,Y)≅C(A,[X,Y]) are part of the internal-hom data (The internal hom and its evaluation morphism).

Proof

technique · direct
1.1givenL1construct

Consider the composite ([Y,Z]⊗[X,Y])⊗X≅[Y,Z]⊗([X,Y]⊗X)→1⊗ev⁡X,Y[Y,Z]⊗Y→ev⁡Y,ZZ. Transposing it across the adjunction −⊗X⊣[X,−] gives a unique morphism comp⁡X,Y,Z:[Y,Z]⊗[X,Y]→[X,Z].

1.2L1construct

Transpose the left unitor λX:1⊗X→X across the same adjunction to obtain uX:1→[X,X].

2.1step 1.1L1algebra

To compare the two composites [Z,W]⊗[Y,Z]⊗[X,Y]⇉[X,W], tensor each with X and postcompose with ev⁡X,W. Both have the same transpose, namely the triple evaluation map [Z,W]⊗[Y,Z]⊗[X,Y]⊗X→W, so the transposition bijection of [L1] forces the two composites to be equal.

2.2step 1.1step 1.2L1algebra

The left and right unit laws are proved the same way: after tensoring with X and evaluating, both candidate composites have transpose ev⁡X,Y. Hence the transposition bijection identifies them, so u is a unit for comp⁡.

3.1step 2.1step 2.2∎

Therefore the internal hom carries a natural composition morphism and objectwise unit morphisms satisfying associativity and the unit laws.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-01Open item page →

The tensor unit is an internal-hom unit

Statement

In a right-closed monoidal category there is a natural isomorphism [1,Y]≅Y for every object Y. Consequently there is a natural bijection

C(1,[X,Y])≅C(X,Y).

Facts & Assumptions

Given: A right-closed monoidal category.

[L1]

The right internal hom [X,−] is right adjoint to −⊗X, with transposition bijection C(A⊗X,Y)≅C(A,[X,Y]) (The internal hom and its evaluation morphism).

[L2]

Right adjoints to a fixed functor are unique up to unique natural isomorphism (The internal hom is unique up to a unique adjunction-compatible natural isomorphism).

Proof

technique · direct
1.1givenL1L2

The right unitor gives natural isomorphisms A⊗1≅A. Applying the transposition bijection of [L1] with X=1 therefore gives natural bijections C(A,Y)≅C(A⊗1,Y)≅C(A,[1,Y]). So the identity functor is also a right adjoint to −⊗1. Since [1,−] is another right adjoint to the same functor, [L2] gives [1,Y]≅Y naturally in Y.

2.1step 1.1L1algebra

Apply the transposition bijection of [L1] with A=1. Because 1⊗X≅X, this gives C(X,Y)≅C(1,[X,Y]). Rewriting the bijection in the opposite direction yields the displayed form.

3.1step 1.1step 2.1∎

Thus the tensor unit recovers the external hom-set from the internal hom.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-01Open item page →

Exponential object

Definition

Let C be a category with binary products (Products and coproducts as limits and colimits of discrete diagrams, including their existence-and-uniqueness equations). For objects B,C, an exponential object of C by B is an object CB together with an evaluation morphism

ev⁡:CB×B→C

such that for every object A and every morphism f:A×B→C there is a unique morphism

λf:A→CB

with

ev⁡∘(λf×1B)=f.

If exponential objects DB are chosen for every object D and these choices are assembled functorially, their universal properties say equivalently that D↦DB is right adjoint to −×B; in particular its value at C is CB. The existence of the single exponential CB alone does not assert that this right adjoint exists on every object.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-01Open item page →

Cartesian closed category

Definition

A category C is cartesian closed when:

  • C has finite products; and
  • for each object B, the functor −×B has a right adjoint.

Writing that right adjoint as (−)B, the object CB is the exponential object of C by B in the sense of Exponential object. Since a category with finite products is canonically monoidal under the cartesian product (A category with finite products is monoidal), a cartesian closed category is exactly a cartesian monoidal category whose tensor product is closed.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-01Open item page →

Set is cartesian closed

Statement

The category Set is cartesian closed. For sets B,C, an exponential object of C by B is the function set CB=Hom⁡Set(B,C) with evaluation (f,b)↦f(b).

Facts & Assumptions

Given: Sets A,B,C.

[L1]

A cartesian closed category has finite products and exponentials, equivalently a right adjoint to each product functor −×B (Cartesian closed category).

[L2]

Set has all small limits, hence in particular finite products (Set has all small limits, realized as compatible tuples in a set-indexed product).

[L3]

In Set, currying gives a natural bijection Set(A×B,C)≅Set(A,CB) (Currying gives the adjunction −×A⊣(−)A in Set).

Proof

technique · direct
1.1givenL2

By [L2], Set has finite products.

1.2givenL3

Let CB be the set of functions B→C, and let ev⁡:CB×B→C send (f,b) to f(b). By [L3], every map A×B→C corresponds naturally and bijectively to a map A→CB. This is exactly the universal property of an exponential object.

2.1step 1.1step 1.2L1∎

Step 1.1 gives the finite-product part of [L1], and step 1.2 gives the right adjoint to −×B for each B. Therefore Set is cartesian closed.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-01Open item page →

The category of small categories is cartesian closed

Statement

The category Cat of small categories is cartesian closed. For small categories D,E, the exponential object of E by D is the functor category [D,E].

Facts & Assumptions

Given: Small categories C,D,E.

[L1]

Cat is cartesian monoidal, so it has finite products (Set, Cat, and every complete category are cartesian monoidal).

[L2]

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

[L3]

A cartesian closed category is one with finite products and a right adjoint to each functor −×D (Cartesian closed category).

Proof

technique · direct
1.1givenL1L2

By [L1], Cat has the finite products required in [L3]. By [L2], the functor category [D,E] is again a small category.

1.2givenL2algebra

A functor F:C×D→E determines a functor F~:C→[D,E] by F~(c)(d)=F(c,d) on objects and similarly on morphisms. Conversely, a functor Φ:C→[D,E] determines Φ^:C×D→E by evaluation, Φ^(c,d)=Φ(c)(d). These assignments are inverse and natural in C.

2.1step 1.1step 1.2L3∎

Step 1.2 is exactly the adjunction Cat(C×D,E)≅Cat(C,[D,E]). Thus −×D has right adjoint [D,−]. With step 1.1, [L3] now gives that Cat is cartesian closed.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-01Open item page →

A presheaf category on a small category is cartesian closed

Statement

Let C be a small category and let C^=SetCop. Then C^ is cartesian closed. For presheaves P,Q, one exponential object is the presheaf defined by

(QP)(c):=Nat⁡(y(c)×P,Q),

with restriction along f:d→c given by precomposition with y(f)×1P.

Facts & Assumptions

Given: A small category C and presheaves H,P,Q on C.

[L1]

The Yoneda embedding sends c to the representable presheaf y(c) (The Yoneda assignment and the small-source Yoneda functor, traditionally called the Yoneda embedding).

[L2]

For any presheaf R, natural transformations y(c)→R are naturally in bijection with elements of R(c) (For a presheaf P, Nat⁡(C(−,a),P)≅P(a) naturally in a and P).

[L3]

In Set, currying gives Set(A×B,C)≅Set(A,CB) (Currying gives the adjunction −×A⊣(−)A in Set).

[L5]

A cartesian closed category has finite products and exponentials (Cartesian closed category).

Proof

technique · direct
1.1givenL1L4algebra

By [L4], binary products in C^ are computed pointwise, so H×P is the presheaf with (H×P)(c)=H(c)×P(c). The assignment c↦Nat⁡(y(c)×P,Q) with restriction by precomposition along y(f)×1P is therefore a presheaf QP.

2.1givenL2L3L4construct

Given α:H→QP, define α~:H×P→Q by sending (h,p)∈H(c)×P(c) to the element of Q(c) corresponding under [L2] to the natural transformation y(c)→hH→αQP, evaluated at p. Conversely, given β:H×P→Q, use [L2] and the set-level currying of [L3] objectwise to define β^c(h)∈Nat⁡(y(c)×P,Q); naturality in c is exactly the restriction rule from step 1.1.

3.1step 2.1L2L3algebra

The two constructions of step 2.1 are inverse because Yoneda identifies a natural transformation out of y(c) with its value at 1c, and the set-level currying and uncurrying in [L3] are inverse. Hence C^(H×P,Q)≅C^(H,QP) naturally in H.

4.1step 1.1step 3.1L4L5∎

Step 3.1 shows that −×P has right adjoint (−)P, while [L4] gives the finite products. Therefore [L5] implies that C^ is cartesian closed.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-01Open item page →

Currying and uncurrying are mutually inverse

Statement

In a cartesian closed category, currying and uncurrying for the adjunction −×B⊣(−)B are mutually inverse. Equivalently, for every f:A×B→C and g:A→CB,

uncurry⁡(curry⁡(f))=f,curry⁡(uncurry⁡(g))=g.

Repeated currying is associative after the canonical reassociation of products.

Facts & Assumptions

Given: A cartesian closed category and objects A,B,C,D.

[L1]

Cartesian closed means that the cartesian product is a closed monoidal tensor, so −×B has right adjoint (−)B (Cartesian closed category, A category with finite products is monoidal).

[L2]

The internal-hom adjunction comes with evaluation and inverse transposition operations (The internal hom and its evaluation morphism).

[L3]

Internal hom composition is obtained by transposing iterated evaluation and is compatible with reassociation (The internal-hom composition morphism).

Proof

technique · direct
1.1givenL1L2

By [L1] and [L2], currying is the transpose map C(A×B,C)→C(A,CB), and uncurrying is its inverse transpose. For any adjunction, transpose followed by inverse transpose and inverse transpose followed by transpose are the identity.

2.1step 1.1algebra

Therefore uncurry⁡(curry⁡(f))=f and curry⁡(uncurry⁡(g))=g.

2.2step 1.1L3algebra

For a morphism h:A×B×C→D, first curry in the C-variable and then in the B-variable. The resulting map A→(DC)B is the transpose of the same iterated evaluation map that produces A→DB×C after reassociating products. By [L3], these coincide under the canonical internal-hom composition isomorphism.

3.1step 2.1step 2.2∎

So currying and uncurrying are mutually inverse, and repeated currying is associative up to the canonical reassociation.

CorollaryStatement: AI-generatedProof: AI-generatedprecheck passaudited 2026-09-01Open item page →

In a cartesian closed category, any initial object is strict

Statement

Let C be a cartesian closed category and let 0 be an initial object. Then 0 is strict: every morphism f:A→0 is an isomorphism.

Facts & Assumptions

Given: A cartesian closed category C, an initial object 0, an object A, and a morphism f:A→0.

[L1]

In a cartesian closed category, the functor A×− is a left adjoint for every A (Cartesian closed category).

[L2]

Left adjoints preserve colimits, hence preserve initial objects (Left adjoints preserve every colimit that exists).

[L3]

An initial object has exactly one endomorphism and exactly one map into any target (Initial object, terminal object, and zero object).

Proof

technique · direct
1.1givenL1L2

By [L1] and [L2], the functor A×− preserves the initial object, so A×0 is initial. Hence there is an isomorphism e:A×0→0.

2.1step 1.1givenalgebra

The pair (1A,f) induces a morphism ⟨1A,f⟩:A→A×0. Let g:=π1∘e−1:0→A, where π1:A×0→A is the first projection. Then g∘f=π1∘e−1∘e∘⟨1A,f⟩=π1∘⟨1A,f⟩=1A.

3.1step 2.1L3

The composite f∘g:0→0 is the unique endomorphism of the initial object, so by [L3] it equals 10. Thus g is a two-sided inverse to f, and f is an isomorphism.

4.1step 3.1∎

Therefore the initial object is strict.

TheoremStatement: AI-adaptedProof: AI-generatedprecheck passaudited 2026-09-01Open item page →

A cartesian closed preorder has relative implications

Statement

Let P be a preorder regarded as a category. If P is cartesian closed, then for every a,b∈P there is an element ba∈P such that for every x∈P,

x≤ba  ⟺  x∧a≤b,

where ∧ is the binary product in the preorder.

Facts & Assumptions

Given: A cartesian closed preorder P and elements a,b,x∈P.

[L1]

A preorder can be regarded as a category with at most one morphism between two objects (A preorder is a category with at most one morphism between any two objects, and its functors are exactly monotone maps).

[L2]

In a cartesian closed category, the product functor −×a has right adjoint (−)a (Cartesian closed category).

[L3]

Binary products satisfy the usual universal property; in a preorder they are meets (Products and coproducts as limits and colimits of discrete diagrams, including their existence-and-uniqueness equations).

Proof

technique · direct
1.1givenL1L3

By [L1], the inequality u≤v is the same as the existence of a morphism u→v in the associated thin category. By [L3], the product x×a is exactly the meet x∧a.

2.1step 1.1L2algebra

Let ba denote the exponential object given by [L2]. The adjunction −×a⊣(−)a gives Hom⁡(x∧a,b)≅Hom⁡(x,ba). Since each hom-set in a preorder is either empty or a singleton, this bijection says precisely that x∧a≤b iff x≤ba.

3.1step 2.1∎

Therefore every cartesian closed preorder has the stated relative implication operation.

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-01Open item page →

Slice categories, composition, and pullback along a morphism

Definition

For an object X of a category C, the slice category C/X has objects arrows a:A→X and morphisms commuting triangles, as in Comma category, slice category, and coslice category.

For a morphism f:X→Y, postcomposition with f defines a functor

Σf:C/X→C/Y,(a:A→X)⟼(f∘a:A→Y).

If chosen pullbacks along f are supplied, they define the pullback functor

f∗:C/Y→C/X,

sending b:B→Y to a chosen pullback square

X×YB→B↓↓bX→fY

and sending a morphism in C/Y to the unique induced morphism between the chosen pullbacks (Pullbacks and pushouts as limits and colimits of cospans and spans). For composable base maps X→fY→gZ, the universal property supplies a canonical natural isomorphism

f∗g∗≅(gf)∗.

Likewise (1X)∗≅1C/X. Thus arbitrary pullback choices are contravariantly pseudofunctorial in the base. Literal functorial equalities in the sense of Covariant functor, identity functor, composite functor, and contravariant functor require coherent split choices and do not follow merely from choosing each pullback separately.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-01Open item page →

Locally cartesian closed category

Definition

A category C is locally cartesian closed when, for every object X, the slice category C/X is cartesian closed in the sense of Cartesian closed category. The slice categories and their pullback functors are those of Slice categories, composition, and pullback along a morphism.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-01Open item page →

Slices of a locally cartesian closed category are locally cartesian closed

Statement

If C is locally cartesian closed, then for every object X the slice category C/X is locally cartesian closed.

Facts & Assumptions

Given: A locally cartesian closed category C, an object X, and an object a:A→X of the slice category C/X.

[L1]

Local cartesian closedness means that every slice C/Z is cartesian closed (Locally cartesian closed category).

[L2]

An object of (C/X)/a is exactly a morphism into a in the slice, equivalently a morphism u:U→A in C over X; this identifies (C/X)/a with C/A (Comma category, slice category, and coslice category).

Proof

technique · direct
1.1givenL2

By [L2], the slice-of-a-slice (C/X)/a is canonically isomorphic to the ordinary slice C/A.

2.1step 1.1L1

Since C is locally cartesian closed, [L1] says that C/A is cartesian closed. Transporting this structure across the isomorphism of step 1.1 shows that (C/X)/a is cartesian closed.

3.1step 2.1given∎

Because a was an arbitrary object of C/X, every slice of C/X is cartesian closed. Hence C/X is locally cartesian closed.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-01Open item page →

A locally cartesian closed category with a terminal object is cartesian closed

Statement

If C is locally cartesian closed and has a terminal object 1, then C is cartesian closed.

Facts & Assumptions

Given: A locally cartesian closed category C with terminal object 1.

[L1]

Every slice C/X of a locally cartesian closed category is cartesian closed (Locally cartesian closed category).

[L2]

A terminal object receives a unique morphism from every object (Initial object, terminal object, and zero object).

Proof

technique · direct
1.1givenL2

The assignment A↦!A:A→1 defines a functor C→C/1, and forgetting the structure map defines a functor back. Because [L2] gives a unique map to 1, these two functors are inverse isomorphisms of categories.

2.1step 1.1L1

By [L1], the slice C/1 is cartesian closed. Transport that structure across the isomorphism of step 1.1 to conclude that C itself is cartesian closed.

3.1step 2.1∎

Therefore a locally cartesian closed category with a terminal object is cartesian closed.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-01Open item page →

A locally cartesian closed category has pullbacks, and with a terminal object it has all finite limits

Statement

Every locally cartesian closed category has pullbacks. If it also has a terminal object, then it has all finite limits.

Facts & Assumptions

Given: A locally cartesian closed category C, and optionally a terminal object 1.

[L1]

Every slice C/X is cartesian closed, hence has binary products (Locally cartesian closed category).

[L2]

A pullback of u:A→X and v:B→X is a universal square over X (Pullbacks and pushouts as limits and colimits of cospans and spans).

[L3]

A terminal object is an object receiving a unique map from every object (Initial object, terminal object, and zero object).

Proof

technique · direct
1.1givenL1L2

Fix arrows u:A→X and v:B→X. Since C/X is cartesian closed by [L1], it has a binary product (p:P→X) of those two slice objects. Its projections are morphisms P→A and P→B over X, and the product universal property in the slice is exactly the pullback universal property of [L2]. So C has pullbacks.

2.1step 1.1L3

Now assume 1 is terminal. A pullback with codomain 1 is an ordinary binary product, because by [L3] every object has a unique map to 1. Thus step 1.1 gives binary products in C, and the given object 1 is terminal.

3.1step 2.1L2algebra

A category with pullbacks and a terminal object has all finite limits: binary products come from step 2.1, and equalizers are pullbacks of the diagonal against a pair of parallel arrows. Hence C has all finite limits.

4.1step 1.1step 3.1∎

Therefore every locally cartesian closed category has pullbacks, and with a terminal object it has all finite limits.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-01Open item page →

Local cartesian closure is equivalent to every pullback functor having a right adjoint

Statement

Let C be a category with chosen pullback functors. Then the following are equivalent.

  1. C is locally cartesian closed.
  2. For every morphism f:X→Y, the pullback functor f∗:C/Y→C/X has a right adjoint.

Facts & Assumptions

Given: A category C with chosen pullback functors.

[L1]

Local cartesian closedness means that every slice category is cartesian closed (Locally cartesian closed category).

[L2]

For each f:X→Y, the functors Σf and f∗ between slice categories are the postcomposition and pullback functors (Slice categories, composition, and pullback along a morphism).

[L3]

Every slice of a locally cartesian closed category is locally cartesian closed, and every locally cartesian closed category has pullbacks (Slices of a locally cartesian closed category are locally cartesian closed, A locally cartesian closed category has pullbacks, and with a terminal object it has all finite limits).

Proof

technique · iff
1.1assume-hypL1L2L3constructalgebra

Assume condition (1), fix f:X→Y, and put K=C/Y. For an object a:A→X of C/X, regard a as a morphism Σfa→f in K. By [L1] and [L3], the category K is cartesian closed and has pullbacks. Form in K the pullback Πf(a):=(Σfa)f×ff1, where (Σfa)f→ff is induced by a and 1→ff is the transpose of 1f:f→f. For B→Y, currying identifies a map B→(Σfa)f with a map h:B×YX→A over Y; the pullback equation defining Πf(a) says exactly that ah is the projection B×YX→X. Hence (C/Y)(B,Πf(a))≅(C/X)(f∗B,a) naturally in B and a. Thus f∗ has right adjoint Πf.

1.2assume-hypL1L2constructalgebra

Assume condition (2), and fix an object X. Chosen pullbacks give binary products in C/X, and 1X:X→X is terminal there. For a:A→X, the pullback universal property gives Σa⊣a∗, while condition (2) gives a∗⊣Πa. The product functor with a on C/X is the composite −×Xa=Σaa∗. Consequently it has right adjoint Πaa∗. Since this holds for every a, the slice C/X is cartesian closed.

2.1step 1.1step 1.2L1∎

Step 1.1 proves that condition (1) implies condition (2). Step 1.2 proves that each slice C/X is cartesian closed, so condition (2) implies condition (1). Therefore the two conditions are equivalent.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-01Open item page →

Set is locally cartesian closed

Statement

The category Set is locally cartesian closed.

Facts & Assumptions

Given: A function f:X→Y and an object p:E→X of the slice category Set/X.

[L1]

A category is locally cartesian closed exactly when each pullback functor f∗ has a right adjoint (Local cartesian closure is equivalent to every pullback functor having a right adjoint).

[L2]

In Set, functions are the morphisms and products are cartesian products (Sets and functions form the large locally small category Set).

[L3]

In Set, currying gives the adjunction between product and function-set formation (Currying gives the adjunction −×A⊣(−)A in Set).

Proof

technique · direct
1.1givenL2construct

For p:E→X, define a set over Y by (ΠfE)y:=∏x∈f−1(y)Ex, where Ex=p−1(x). An element of (ΠfE)y is therefore a choice of one element of Ex for each x over y; when f−1(y)=∅, this product is the singleton empty family. The projection ΠfE→Y sends such a family to y.

2.1step 1.1L2L3algebra

If q:B→Y is another object over Y, then a morphism q→ΠfE over Y assigns to each b∈B over y=q(b) a family of elements in the fibers Ex for x∈f−1(y). Equivalently, it assigns to each pair (b,x) with q(b)=f(x) an element of Ex, which is exactly a morphism f∗q→p over X. This correspondence is natural and is the fiberwise form of [L3].

3.1step 2.1L1∎

Step 2.1 constructs a right adjoint Πf to every pullback functor in Set. Hence [L1] implies that Set is locally cartesian closed.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-01Open item page →

Subobject classifier

Definition

Let C be a category with a terminal object 1 (Initial object, terminal object, and zero object) and pullbacks (Pullbacks and pushouts as limits and colimits of cospans and spans).

A subobject classifier is a monomorphism

true⁡:1→Ω

(Monomorphism and epimorphism by left and right cancellation) such that for every monomorphism m:A→X there exists a unique morphism χm:X→Ω for which m is, up to isomorphism of pullback objects, the pullback of true⁡ along χm.

The map χm is the classifying morphism of the subobject represented by m. The uniqueness clause is part of the definition: the classifier classifies subobjects in the sense of Subobject and quotient object as mutual-factorisation classes of monomorphisms and epimorphisms, not arbitrary representing monomorphisms.

TheoremStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-01Open item page →

With a supplied well-powering, a subobject classifier represents the subobject functor

Statement

Assume C is locally small, has a subobject classifier true⁡:1→Ω, and has a supplied well-powering X↦MX. For each object X, let Sub⁡M(X) be the quotient set of MX by mutual factorization. Then X↦Sub⁡M(X) is a contravariant Set-valued functor, and the classifier induces a natural isomorphism

C(−,Ω)⇒≅Sub⁡M.

Thus Ω represents the supplied representative-set form of the subobject functor.

Facts & Assumptions

Given: A locally small category C with a subobject classifier true⁡:1→Ω and a supplied well-powering X↦MX.

[L1]

A subobject classifier assigns to each monomorphism m:A→X a unique classifying map χm:X→Ω whose pullback of true⁡ recovers the same subobject (Subobject classifier).

[L2]

A supplied well-powering gives a set MX of monomorphisms into each object X, containing a representative of every subobject class (Well-powered and co-well-powered categories, and supplied well-powerings).

[L3]

Mutual factorization is an equivalence relation on monomorphisms into a fixed object, and subobjects are precisely those equivalence classes (Subobject and quotient object as mutual-factorisation classes of monomorphisms and epimorphisms, Mutual factorisation is an equivalence relation on monomorphisms into an object and dually on epimorphisms out of it).

[L4]

A contravariantly representable functor is a natural isomorphism C(−,Ω)≅P for some presheaf P (Presheaves, covariantly and contravariantly representable functors, and representations).

Proof

technique · direct
1.1givenL2L3

By [L3], the quotient Sub⁡M(X):=MX/∼ by mutual factorization is a well-defined set for each X, and its elements correspond exactly to subobject classes of X represented inside the supplied set MX.

2.1step 1.1L2L3construct

For a morphism u:X→Y and a class [m]∈Sub⁡M(Y), pull back m along u. The resulting monomorphism into X defines a subobject class of X, and [L2] provides a representative of that class in MX; step 1.1 shows that the resulting element of Sub⁡M(X) is independent of the chosen representative. Hence X↦Sub⁡M(X) is a contravariant functor.

3.1givenL1step 2.1construct

For each X, define ΦX:C(X,Ω)→Sub⁡M(X) by sending f:X→Ω to the class of the pullback of true⁡ along f. Conversely, define ΨX:Sub⁡M(X)→C(X,Ω) by sending the class of m to its unique classifying map χm from [L1].

4.1step 3.1L1L3algebra

The composites are identities. If f:X→Ω, then ΨX(ΦX(f))=f because the pullback subobject of true⁡ along f is classified by f itself, and that classifying map is unique by [L1]. If [m]∈Sub⁡M(X), then the pullback of true⁡ along χm represents the same subobject class as m, so ΦX(ΨX([m]))=[m]. Naturality follows because pullback commutes with composition of classifying maps.

5.1step 2.1step 4.1L4∎

Therefore Φ is a natural isomorphism C(−,Ω)≅Sub⁡M. By [L4], Ω represents the supplied representative-set form of the subobject functor.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-01Open item page →

The two-element set is a subobject classifier for Set

Statement

In Set, the inclusion

true⁡:1={∗}→2={0,1},∗↦1,

is a subobject classifier.

Facts & Assumptions

Given: A monomorphism m:A→X in Set.

[L1]
[L3]

A subobject classifier is a monomorphism 1→Ω whose pullbacks classify all subobjects uniquely (Subobject classifier).

Proof

technique · direct
1.1givenL1L2construct

By [L1] and [L2], m is an injection. Its image m[A]⊆X is a subset, and the bijection A→m[A] identifies m with the inclusion m[A]↪X. Define χm:X→2 by χm(x)=1 for x∈m[A] and χm(x)=0 otherwise.

2.1step 1.1L1algebra

The pullback of true⁡:1→2 along χm has underlying set χm−1(1)=m[A], so its inclusion into X represents the same subobject as m via the bijection from step 1.1.

3.1step 2.1L3algebra∎

If f:X→2 has a pullback representing the same subobject as m, then f−1(1)=m[A], so f agrees pointwise with χm. Hence the classifying map is unique. By [L3], true⁡:1→2 is a subobject classifier.

RemarkRemark: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-01Open item page →

Boundary: this page stops before elementary and Grothendieck toposes

This page develops closed monoidal categories, cartesian closed categories, locally cartesian closed categories, and subobject classifiers. It does not add the remaining axioms of an elementary topos, and it does not enter Grothendieck-topos or Giraud-theorem territory. Those subjects need separate logical and sheaf-theoretic infrastructure.

5 · Examples, counterexamples and false statements

CounterexampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-01Open item page →

A monoidal category need not be closed

Statement refuted

Every monoidal category is closed.

Facts & Assumptions

Given: The five-element diamond lattice M3={0,p,q,r,1} with 0<p,q,r<1 and p,q,r pairwise incomparable.

[L1]

A poset with top element and binary meets becomes a strict monoidal category under meet (A poset with finite meets is a strict monoidal category).

[L2]

In a lattice, binary meets exist and are written ∧ (Lattices, distributive lattices, and order ideals).

[L3]

Right closed means that, for each fixed object X, the functor −⊗X has a right adjoint (Left-closed, right-closed, and biclosed monoidal categories).

Counterexample

technique · direct
1.1givenL1L2

In M3, the meet operation satisfies p∧q=0, p∧r=0, and p∧1=p, while q and r are incomparable below 1. By [L1] and [L2], the associated poset-category is a strict monoidal category with tensor product ∧ and unit 1.

2.1step 1.1givenalgebra

Fix X:=p and Y:=q. An object a satisfies a∧p≤q exactly when a∈{0,q,r}: this holds for 0,q,r, fails for 1 because 1∧p=p≰q, and fails for p because p∧p=p≰q.

3.1step 2.1L3algebra∎

The set {0,q,r} has no greatest element, since q and r are incomparable and both dominate 0. Therefore there is no object [p,q] with a≤[p,q] iff a∧p≤q, so the functor −∧p has no right adjoint. By [L3], this monoidal category is not right closed and hence not closed.

False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-01Open item page →

FALSE: every monoidal category is closed

Statement

Every monoidal category is closed.

Facts & Assumptions

Given: The diamond-lattice monoidal category from A monoidal category need not be closed.

[L1]

The counterexample item constructs a monoidal category for which −⊗p has no right adjoint, so the category is not closed (A monoidal category need not be closed).

Refutation

technique · direct
1.1givenL1

The category exhibited in [L1] is monoidal.

2.1step 1.1L1

The same category is not closed, because tensoring with the chosen object p has no right adjoint. Therefore a monoidal category need not be closed.

3.1step 2.1∎

So the statement is false.

False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-01Open item page →

FALSE: the left and right internal homs agree in every monoidal category

Statement

The left and right internal homs agree in every monoidal category.

Facts & Assumptions

Given: Let R be the ring of upper-triangular 2×2 matrices over a field k, let N=ke12⊂R, and work in the monoidal category of R-bimodules with tensor product ⊗R. Set X:=R/N and Y:=R.

[L1]

Left and right internal homs are defined separately as right adjoints to X⊗− and −⊗X (Left-closed, right-closed, and biclosed monoidal categories).

[L2]

An (R,R)-bimodule has commuting left and right actions, and balanced pairings induce unique maps from tensor products ((S,R)-bimodules and commuting left and right scalar actions, Universal property of the tensor product for balanced maps into abelian groups).

Refutation

technique · direct
1.1L1L2givenconstructalgebra

For bimodules A,X,Y, a bimodule map h:A⊗RX→Y corresponds to the bimodule map a⟼(x⟼h(a⊗x)) from A to Hom⁡−R(X,Y), where (rφs)(x)=rφ(sx). The inverse is evaluation, (a,x)↦φa(x); balancing and the two bimodule actions make both constructions well defined by [L2]. Thus Hom⁡−R(X,−) is right adjoint to −⊗RX. Similarly, maps X⊗RA→Y correspond to maps A→Hom⁡R−(X,Y), with (rψs)(x)=ψ(xr)s. Hence [L1] identifies these as the right and left internal homs respectively.

2.1step 1.1givenalgebra

A right R-linear map f:R/N→R is determined by a:=f(1+N), and it is well defined exactly when aN=0. Thus [X,Y]≅ann⁡ℓ(N)={0b0c:b,c∈k}.

2.2step 1.1givenalgebra

A left R-linear map g:R/N→R is determined by b:=g(1+N), and it is well defined exactly when Nb=0. Thus ⟨X,Y⟩≅ann⁡r(N)={ab00:a,b∈k}.

3.1step 2.1step 2.2L1algebra

These two bimodules are not isomorphic: every element of ann⁡r(N) is annihilated on the left by e22, while e22⋅e22=e22≠0 in ann⁡ℓ(N). By [L1], the left and right internal homs therefore need not agree.

4.1step 3.1∎

Hence the statement is false.

False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-01Open item page →

FALSE: every cartesian closed category has all finite limits

Statement

Every cartesian closed category has all finite limits.

Facts & Assumptions

Given: The full subcategory Set≠∅ of Set on the nonempty sets.

[L1]

A cartesian closed category is required to have finite products and exponentials, but not arbitrary finite limits as part of the definition (Cartesian closed category).

[A1]

If A,B are nonempty sets, then A×B and BA are again nonempty, so Set≠∅ is cartesian closed.

Refutation

technique · direct
1.1givenL1A1

By [A1], the category Set≠∅ has products and exponentials for all of its objects, so by [L1] it is cartesian closed.

2.1step 1.1givenalgebra

Consider the two constant maps 1⇉2 with values 0 and 1. Their equalizer in Set is the empty set, which is not an object of Set≠∅. So that equalizer does not exist in Set≠∅.

3.1step 2.1∎

Therefore a cartesian closed category need not have all finite limits. The statement is false.

False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-01Open item page →

FALSE: every cartesian closed category is locally cartesian closed

Statement

Every cartesian closed category is locally cartesian closed.

Facts & Assumptions

Given: The category Set≠∅ of nonempty sets.

[L1]

Local cartesian closedness requires every slice to be cartesian closed (Locally cartesian closed category).

[A1]

The category Set≠∅ is cartesian closed, by the same function-set argument as in the previous false statement.

Refutation

technique · direct
1.1givenA1

By [A1], Set≠∅ is cartesian closed.

2.1step 1.1givenalgebra

In the slice over the two-point set 2={0,1}, consider the singleton inclusions {0}↪2 and {1}↪2. Their product in the slice would be their pullback, which is the empty set over 2. That object is not present in Set≠∅/2.

3.1step 2.1L1∎

So the slice over 2 is not even finitely complete, hence not cartesian closed. Therefore Set≠∅ is not locally cartesian closed, and the statement is false.

False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passaudited 2026-09-01Open item page →

FALSE: a subobject classifier is any object representing monomorphisms

Statement

A subobject classifier is any object representing monomorphisms.

Facts & Assumptions

Given: The set X={0,1} and the two singleton inclusions m:{a}→X, n:{b}→X with m(a)=0=n(b).

[L1]

A subobject classifier classifies subobjects, meaning mutual-factorization classes of monomorphisms, and the classifying map is unique for that class (Subobject classifier, Subobject and quotient object as mutual-factorisation classes of monomorphisms and epimorphisms).

[L2]

Two monomorphisms representing the same subobject class need only be isomorphic, not literally equal as arrows (Mutual factorisation is an equivalence relation on monomorphisms into an object and dually on epimorphisms out of it).

Refutation

technique · direct
1.1givenL2

The monomorphisms m and n have different domains and are different arrows, but they factor through each other via the unique bijection {a}≅{b}. So [L2] says that they represent the same subobject of X.

2.1step 1.1L1

Any classifier must assign the same characteristic map to the subobject class represented by m and n, because [L1] classifies subobjects rather than literal presenting monomorphisms. Therefore no object representing monomorphisms as bare arrows can be the right notion.

3.1step 2.1∎

So the statement is false.

Sources