Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passaudited 2026-08-26
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

A Kan extension computing the free-group functor

Example

Let 1 be the one-object category, so [1op,Set]≅Set. Let y:1→Set be the Yoneda embedding. Choose a free group F({∗}) on the one-element set {∗}, and let F:1→Grp send the unique object to that group.

Then the left Kan extension Lan⁡yF:Set→Grp is the free-group functor.

Facts & Assumptions

Given: The one-object category 1, the Yoneda embedding y, and the functor whose value is a chosen free group on {∗}.

[L1]

The free-cocompletion theorem makes Lan⁡yF left adjoint to Grp(F−,−) (The presheaf category on a small category is the free cocompletion).

[L2]

Choosing a free group on every set gives a free-group functor left adjoint to the underlying-set functor; at {∗} its adjunction bijection is Grp(F({∗}),G)≅U(G) naturally in G (The free-group functor is left adjoint to the underlying-set functor).

[L3]

Two left adjoints to the same functor are uniquely naturally isomorphic compatibly with their adjunction data (Adjoints are unique up to a unique natural isomorphism compatible with the adjunction data).

[F2]

Groups and group homomorphisms form the locally small category Grp, and Grp has all small colimits (Groups and group homomorphisms form the large locally small category Grp, Grp is complete and cocomplete).

Verification

technique · direct
1.1F1F2L1

By [F1], the functor Lan⁡yF has domain Set, and [F2] verifies the locally small and cocomplete target hypotheses of [L1]. Hence [L1] makes it left adjoint to the functor G↦Grp(F({∗}),G).

2.1L2step 1.1

By [L2], the functor G↦Grp(F({∗}),G) is naturally isomorphic to the underlying-set functor on groups. Therefore Lan⁡yF is a left adjoint to the underlying-set functor.

3.1L2L3step 2.1∎

The published free-group functor is also a left adjoint to the underlying-set functor by [L2], so [L3] identifies Lan⁡yF with that free functor.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

35 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources