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.

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

Duality and Rigidity in Monoidal Categories - Examples

1 · Prerequisites

2 · Summary

These examples compute the abstract duality data in the familiar setting of finite-dimensional vector spaces, then move back to endofunctors to show how an adjunction literally is a duality in a composition tensor product. The final examples also keep the hypothesis ladder honest: infinite-dimensional vector spaces break rigidity, while symmetric monoidal categories may have object-by-object self-duality without any canonical choice.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: Literature-sourcedVerification: AI-generatedprecheck passaudited 2026-09-04Open item page →

The dual of a finite-dimensional vector space as a categorical dual

Example

Let V be a finite-dimensional vector space over a field k. Its algebraic dual V, together with evaluation fvf(v) and coevaluation 1ivivi for a basis (vi) and dual basis (vi), is a categorical dual of V.

Facts & Assumptions

Given: A finite-dimensional vector space V.

[L1]

Finite-dimensional vector spaces are rigid with dual object V (Finite-dimensional vector spaces are rigid).

Verification

technique · direct
1.1

Theorem Finite-dimensional vector spaces are rigid proves that these maps make V both a left dual and a right dual of V in Vectk.

givenL1
2.1

So the familiar linear-algebra dual object is exactly a categorical dual in the monoidal sense.

step 1.1
ExampleConstruction: Literature-sourcedVerification: AI-generatedprecheck passaudited 2026-09-04Open item page →

The zig-zag identities in finite-dimensional vector spaces

Example

For a finite-dimensional vector space V with basis (vi) and dual basis (vi), the two zig-zag identities become ordinary Kronecker-delta computations.

Facts & Assumptions

Given: A finite-dimensional vector space V with basis (vi) and dual basis (vi).

[L1]

The standard duality data on V and V exist (Finite-dimensional vector spaces are rigid).

Verification

technique · direct
1.1

By Finite-dimensional vector spaces are rigid, the categorical dual data are V, the evaluation pairing, and the coevaluation 1ivivi.

givenL1
2.1

On a basis vector vj, the first zig-zag gives ivi(vj)vi=iδijvi=vj. On a dual basis vector vj, the second zig-zag gives ivj(vi)vi=iδjivi=vj.

step 1.1algebra
3.1

Hence the abstract zig-zag identities of The zig-zag identities reduce here to the familiar basis-and-dual-basis calculation.

step 2.1
ExampleConstruction: Literature-sourcedVerification: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

The categorical trace of a linear endomorphism is its matrix trace

Example

For a finite-dimensional vector space V and a linear endomorphism T:VV, the categorical trace of JVT:VV is the ordinary trace of T.

Facts & Assumptions

Given: A finite-dimensional vector space V and a linear endomorphism T:VV.

[L1]

The map JV:VV is the canonical comparison (The canonical evaluation map JV:VV given by JV(v)(f)=f(v)).

[L2]

The ordinary trace of T is defined basis-independently by The basis-independent trace of an endomorphism of a finite-dimensional vector space, and the categorical trace applies to JVT by The categorical trace of a morphism into the double dual.

Verification

technique · direct
1.1

The canonical map JV:VV from The canonical evaluation map JV:VV given by JV(v)(f)=f(v) is the standard pivotal comparison for finite-dimensional vector spaces, so JVT is an input for the categorical trace of The categorical trace of a morphism into the double dual.

givenL1L2
2.1

In a basis (vi) with dual basis (vi), write T(vj)=iaijvi. Then TrL(JVT)=iJV(T(vi))(vi)=ivi(T(vi))=iaii.

step 1.1algebra
3.1

The right-hand side is exactly the ordinary trace of T by The basis-independent trace of an endomorphism of a finite-dimensional vector space. So the categorical trace specializes to the matrix trace in finite-dimensional linear algebra.

step 2.1L2
ExampleConstruction: Literature-sourcedVerification: AI-generatedprecheck passaudited 2026-09-04Open item page →

The categorical dimension of a vector space is the scalar image of its linear dimension

Example

Let k be a field. For finite-dimensional k-vector spaces with the canonical pivotal structure, the categorical dimension is the image of the usual linear dimension in k.

Facts & Assumptions

Given: A field k and a finite-dimensional k-vector space V.

[L1]

Categorical dimension is the trace of the chosen pivotal comparison (The dimension of an object relative to a pivotal structure).

[L3]

Finite-dimensional k-vector spaces are rigid with the usual duality (Finite-dimensional vector spaces are rigid).

Verification

technique · direct
1.1

Let V have basis (v1,,vn). With the usual duality from [L3], the canonical pivotal structure has component JV:VV given by JV(v)(f)=f(v), and dimJ(V) is by definition the categorical trace of JV The dimension of an object relative to a pivotal structure.

givenL1L3
2.1

Using the same basis-and-dual-basis computation as for categorical trace, dimJ(V)=i=1nJV(vi)(vi)=i=1nvi(vi)=n1kk.

step 1.1algebra
3.1

The natural number n is the ordinary dimension of V by Finite-dimensional vector space, and its dimension dimFV; infinite-dimensional means having no finite basis. Hence the categorical dimension is its scalar image n1k in End(k)k. In positive characteristic this scalar can differ from n as a natural number; for example, a p-dimensional space has categorical dimension 0k when chark=p.

step 2.1L2
CounterexampleConstruction: Literature-sourcedVerification: AI-generatedprecheck passaudited 2026-09-04Open item page →

An infinite-dimensional vector space has no dual object

Statement refuted

An infinite-dimensional vector space can serve as a dualizable object in Vectk.

Facts & Assumptions

Given: The infinite-dimensional vector space k[x].

[L1]

The earlier counterexample already proves that this space has no dual object (Not every monoidal category is rigid).

Counterexample

technique · direct
1.1

The argument in Not every monoidal category is rigid already applies to the concrete infinite-dimensional space k[x]: any coevaluation coev(1) is a finite sum ivifi.

givenL1
2.1

The zig-zag identity would then force every polynomial to be a linear combination of the finitely many vi, contradicting the infinite-dimensionality of k[x].

step 1.1L1
3.1

Therefore k[x] has no dual object in the categorical sense.

step 2.1
ExampleConstruction: Literature-sourcedVerification: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

An adjunction read as a duality of endofunctors

Example

Fix a set A. In the endofunctor category of Set under composition, the functor ()×A has right dual the exponential functor ()A.

Facts & Assumptions

Given: A set A and the endofunctors ()×A and ()A of Set.

[L1]

Currying gives an adjunction ()×A()A (Currying gives the adjunction ×A()A in Set).

[L2]

In the composition monoidal category, right adjoints are exactly right duals (A dual object in the endofunctor category is an adjoint functor).

Verification

technique · direct
1.1

The currying theorem Currying gives the adjunction ×A()A in Set says exactly that ()×A()A.

givenL1
2.1

By A dual object in the endofunctor category is an adjoint functor, a right adjoint of an endofunctor is exactly its right dual in the composition monoidal category. Therefore ()A is the right dual of ()×A.

step 1.1L2
3.1

So this ordinary adjunction is literally an instance of categorical duality in an endofunctor monoidal category.

step 2.1
ExampleConstruction: Literature-sourcedVerification: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

A symmetric monoidal category in which every object is self-dual

Example

The symmetric monoidal category of finite-dimensional vector spaces over a field has the property that every object is isomorphic to its dual.

Facts & Assumptions

Given: A finite-dimensional vector space V.

[L1]

The dual object V exists in the category (Finite-dimensional vector spaces are rigid).

Verification

technique · direct
1.1

By Finite-dimensional vector spaces are rigid, every finite-dimensional vector space V has dual object V.

givenL1
3.1

Thus every object is self-dual up to isomorphism. The example is still only objectwise: the choice of isomorphism is generally noncanonical.

step 2.1

Sources