Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 2026-09-06 rests on unproved material (inherited)
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.

Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

The Yoneda product is associative and unital

Statement

In an abelian category, define YExt0(M,N)=Hom(M,N). The product of two degree-zero classes is ordinary composition of their morphisms, in the displayed splice order. Splicing a positive-degree extension with a degree-zero morphism means the corresponding pullback at its quotient endpoint or pushout at its subobject endpoint. With this convention, Yoneda splicing is associative on equivalence classes and identity morphisms are two-sided units.

Facts & Assumptions

Given: Three composable classes of nonnegative degrees, with the product convention in the statement and positive-degree splicing as in The Yoneda splice product.

[F1]

Positive-degree splicing descends to generated equivalence classes (Yoneda splicing is well-defined on equivalence classes, Equivalence of n-fold extensions).

[F2]

Pullbacks preserve epimorphisms and pushouts preserve monomorphisms in an abelian category (The pullback of an epimorphism is an epimorphism, The pushout of a monomorphism is a monomorphism).

[F3]

A morphism of short exact sequences that is the identity on the endpoints is an isomorphism on the middle object (Short five lemma in an abelian category).

Proof

technique · direct
1.1

Endpoint pullback and pushout preserve exact extensions by [F2] and the universal properties of kernels and cokernels. An endpoint-preserving chain map induces a chain map of their pullbacks or pushouts, again fixing the new endpoints. Thus these operations respect every generating map and hence the generated equivalence relation. Together with [F1] and ordinary composition, the product is defined on classes in every pair of degrees.

F1F2givenconstruct
1.2

If all three degrees are positive, both parenthesizations concatenate the same list of middle objects with the same junction maps, so their extensions agree. If all are zero, associativity is the category's associativity of morphism composition.

givenalgebra
2.1

For two consecutive degree-zero factors, iterated pullback is canonically the pullback along the composite map, and iterated pushout is canonically the pushout along the composite map, by their universal properties. This treats degree patterns (+,0,0) and (0,0,+). For patterns (0,+,+) and (+,+,0), the outer endpoint pushout or pullback affects only the outer endpoint of the concatenation, giving the same extension before or after concatenating.

step 1.1construct
2.2

For the pattern (0,+,0), endpoint pushout and endpoint pullback commute up to canonical equivalence. For extension length at least two, they modify distinct outer middle objects and their universal maps commute. For a short extension 0BEA0, a quotient map f:AA and a subobject map g:BB give a canonical map g(fE)f(gE): the maps to gE and to A agree over A, and the map from B is supplied by the pushout. It fixes B and A, so [F3] makes it an isomorphism of short extensions. This proves the remaining pattern with two zero degrees.

F3step 1.1construct
2.3

For the pattern (+,0,+), let ξ extend L by N, let f:KL, and let η extend M by K. The two products are (fξ)η and ξ(fη). There is a chain map from the first spliced extension to the second: use the pullback projection on the last middle object of ξ, the pushout map on the first middle object of η, and identities elsewhere and at N,M. At the junction its square commutes by the defining equations of that pullback and pushout; all other squares are their endpoint squares or identity squares. Hence these two extensions are equivalent by the generated relation, which needs no isomorphism of all middle objects.

F1step 1.1construct
3.1

Steps 1.2 and 2.1–2.3 exhaust the eight patterns of zero and positive degrees, proving associativity. Pullback along an identity and pushout along an identity are canonically isomorphic to the original extension by their universal properties. In degree zero the same assertion is the identity law for composition. Thus identity morphisms give both units in every degree.

step 1.1step 1.2step 2.1step 2.2step 2.3algebra

Depends on

Used by

Dependency tree · two levels

19 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