Alphabeta Math
CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-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.

An additive coefficient group does not determine a cup multiplication

Statement refuted

A bare abelian coefficient group determines a unital coefficient multiplication, and hence a unital cup multiplication on its cochains, without additional data.

Facts & Assumptions

[F1]

Singular cup product on cochains uses multiplication of coefficient values in its front/back formula. For degree-zero cochains, its value on a vertex is that coefficient multiplication.

Counterexample

Given: The additive group G=Z2. For x=(a,b) and y=(c,d) consider xy=(ac,bd),xy=(ac,ad+bc).

1.1

Both operations are bilinear and commutative. The first is associative coordinatewise and has unit (1,1). For the second, if z=(e,f), both (xy)z and x(yz) equal (ace,acf+ade+bce); its unit is (1,0). Thus these define commutative unital rings on the same additive group. They are respectively Z×Z and Z[ϵ]/(ϵ2), with (a,b) corresponding to a+bϵ in the latter.

givenalgebra
1.2

More strongly, let μ:G×GG be bilinear and invariant under every additive automorphism, meaning f(μ(x,y))=μ(f(x),f(y)). With f=id, bilinearity gives μ(x,y)=μ(x,y)=μ(x,y). Thus 2μ(x,y)=0, and torsion-freeness of Z2 forces μ=0. A zero multiplication cannot have a unit on a nonzero group, since μ(u,(1,0))=0(1,0). Consequently no unital multiplication can be recovered in a manner invariant under all additive automorphisms. The zero bilinear pairing is indeed canonical; the refuted claim concerns a unital multiplication, not the existence of any pairing.

givenalgebra
2.1

In the first ring the idempotents are exactly (0,0),(1,0),(0,1),(1,1), since an integer satisfies a2=a exactly when a=0 or 1. In the second ring, an idempotent satisfies a2=a and (2a1)b=0. For a=0 or 1, the second equation forces b=0. There are exactly two idempotents. Any ring isomorphism bijects idempotents, so these two rings are not isomorphic.

step 1.1algebra
3.1

At the point space, degree-zero cochains with values in G are just G, and [F1]'s formula multiplies their values. The two displayed ring structures therefore give different cup operations already there, and step 1.2 rules out a natural unital choice from additive data alone. For example (1,0)(0,1)=0, while (1,0)(0,1)=(0,1). This fixed nonempty, nonzero, degree-zero example has no endpoint or higher-simplex qualification. The zero coefficient group would not witness failure; neither would empty-space cochains. All operations, automorphism and idempotents used here are explicit, with no AC.

F1step 1.1step 2.1step 1.2

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

6 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