Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-13
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.

The Yoneda embedding of the walking-arrow category computed objectwise

Example

Let W be the walking-arrow category 0u1. Its only morphisms are 10,u,11. The Yoneda embedding y:W[Wop,Set] has the table

01uop:10y(0)=W(,0){10}{10}y(1)=W(,1){u}{11}11u

and y(u):y(0)y(1) has components 10u at 0 and the empty function at 1.

Facts & Assumptions

Given: The category W with the two objects and three morphisms displayed above.

[F1]

A category has identity morphisms, associative composition, and the two identity laws (Category, object, morphism, domain, codomain, identity, composition, and hom-collection).

[F2]

For a small category, the Yoneda functor sends a to W(,a) and h:ab to postcomposition W(,h) (The Yoneda assignment and the small-source Yoneda functor, traditionally called the Yoneda embedding).

[L1]

The Yoneda functor is fully faithful: postcomposition gives a bijection W(a,b)Nat(y(a),y(b)) (The Yoneda functor is fully faithful, and it is a full embedding when its object map is injective).

[F3]

A function gives one value for each domain element; no function has a nonempty domain and empty codomain, while there is exactly one empty function (A function is a relation f with (a,b)f and (a,c)f implying b=c; f:AB, the value f(a), domain and codomain).

Verification

technique · direct
1.1

The hom-sets are W(0,0)={10}, W(0,1)={u}, W(1,1)={11}, and W(1,0)=. These are exactly the four object values in the displayed table.

given
2.1

A presheaf represented by a acts on uop:10 by precomposition with u. For a=0 this is the empty function {10}; for a=1 it sends 11 to 11u=u by [F1].

step 1.1F1F2F3
2.2

By [F2], y(u) is postcomposition with u. At 0 it sends 10 to u10=u, and at 1 it is the unique empty function. This proves the asserted component table, including the empty hom-set.

step 1.1F1F2F3
3.1

There is one natural transformation y(0)y(0) and one y(0)y(1), namely the identity and y(u). There is no transformation y(1)y(0) because its component at 1 would be a function {11}, forbidden by [F3].

step 1.1step 2.1step 2.2F3
4.1

A transformation y(1)y(1) has forced singleton-to-singleton components, and the naturality square commutes by [F1], so it is the identity. Hence the four natural-transformation sets have the same empty-or-singleton table as the four hom-sets, exactly as [L1] asserts.

step 1.1step 2.1step 3.1F1L1
5.1

Composition in the image has only the identity composites and y(u) composed with an identity; by [F1] and step 2.2 these reproduce the composition of 10,u,11 in W.

step 2.2step 4.1F1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 45 results over 19 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources