Alphabeta Math
False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 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.

FALSE: dinatural transformations compose

Statement

False claim: for functors P,Q,R:Cop×C→D and dinatural transformations α:P→Q and β:Q→R (Dinatural transformation between functors on Cop×C), the componentwise composite (βc∘αc)c is a dinatural transformation P→R; so the functors on Cop×C and the dinatural transformations between them form a category.

Facts & Assumptions

Given: The walking arrow C, with objects 0 and 1 and one non-identity morphism u:0→1, and the category Set as target.

[F1]

A dinatural transformation α:P→Q is a family αc:P(c,c)→Q(c,c) such that every f:c→c′ satisfies Q(1c,f)∘αc∘P(f,1c)=Q(f,1c′)∘αc′∘P(1c′,f), the equation displayed by the hexagon (Dinatural transformation between functors on Cop×C).

[L1]

There are a category, three set-valued functors on Cop×C and two dinatural transformations between them whose componentwise composite is not dinatural: dinatural transformations do not compose in general (Dinatural transformations do not compose in general).

[L2]

For natural σ:P′⇒P and τ:Q⇒Q′ and dinatural α:P→Q, composing a dinatural transformation with a natural transformation on either side gives a dinatural transformation (Composing a dinatural transformation with a natural transformation on either side gives a dinatural transformation).

Refutation

technique · direct
1.1F1givenconstruct

The witness is restated in full so that this item stands alone. Take C to be the walking arrow, so that a functor T:Cop×C→Set is four sets and four functions subject to one equation. Let P have all four values a one-element set; let Q have Q(1,0)=∅ and Q(0,0),Q(1,1),Q(0,1) one-element sets; and let R have R(1,0)=∅, R(0,0)={c}, R(1,1)={d} and R(0,1)={y1,y2} with y1≠y2, with R(10,u)(c)=y1 and R(u,11)(d)=y2. Let α:P→Q and β:Q→R be the families whose components are the only functions available between one-element sets.

2.1F1L1step 1.1

Both families are dinatural and their composite is not. The hexagon for α at u is an equation between two functions into the one-element set Q(0,1), so it holds; the hexagon for β at u is an equation between two functions out of Q(1,0)=∅, so it holds; and the two legs of the hexagon for the composite send the element of P(1,0) to y1 and to y2 respectively, which differ. This is exactly the witness of [L1], so the displayed claim is false and the dinatural transformations are not the morphisms of a category under componentwise composition.

3.1L2step 2.1∎

What is true is the weaker statement [L2]: a dinatural transformation composed with a natural transformation on either side is again dinatural. So dinaturality is not closed under nothing; it is closed under composition with natural transformations, and the false claim is exactly the extension of that to two dinatural factors.

Remarks

The mechanism is the empty slot. Putting ∅ in the (1,0) position of Q and of R makes the hexagon for β an equation between functions with empty domain, so β is dinatural for no reason of its own; the one-element set in the (0,1) position of Q does the same for α at the other end. Nothing then constrains the composite, whose hexagon has a two-element codomain.

The claim is a genuine trap rather than a careless one, because the analogous statement for natural transformations is true and is what makes functor categories exist. What fails here is that a dinatural transformation has components only on the diagonal, so composing two of them loses the off-diagonal information that each one's hexagon was about.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

9 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