Alphabeta Math
CounterexampleConstruction: AI-generatedVerification: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16
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 componentwise family of morphisms need not be a natural transformation and hence need not be a unit

Statement refuted

For functors F:C→D and G:D→C, any family of correctly typed morphisms ηX:X→GFX is a possible unit.

Facts & Assumptions

Given: The identity functors F=G=1Set, the von Neumann sets 1={0} and 2={0,1}, and the inclusion i:1→2 with i(0)=0.

[F1]

A natural transformation α:F⇒G must satisfy Gf∘αA=αB∘Ff for every f:A→B (Natural transformation and its components).

[F2]

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

[F3]

A unit of an adjunction is a natural transformation 1C⇒GF (Adjunction by unit, counit, and the triangle identities).

Counterexample

technique · direct
1.1F2construct

Let η2:2→2 transpose 0 and 1, and let ηX=1X for every set X≠2. These are correctly typed components in the category [F2].

2.1step 1.1F1

For i:1→2, the left side of [F1] is iη1, which sends 0 to 0, while the right side is η2i, which sends 0 to 1. Thus the naturality equation fails.

3.1step 2.1F3∎

The family is not a natural transformation and therefore cannot be a unit by [F3]. Correct component types alone do not suffice.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

11 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