Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-generatedjudge pass (gpt-6-luna)
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 minimal A∞-model whose ternary operation realizes a triple Massey product

Example

Let k be a field. Define a cohomological DGA A with

A0=k{1A,x,y,z,a,b},A−1=k{u,v,c},Aj=0(j≠0,−1).

The element 1A is a unit. On nonunit basis elements, the only nonzero products are xy=a, yz=b, and xv=c; all other such products are zero. Set d(u)=a, d(v)=b, and d=0 on the other basis elements.

For the cohomology of A, the triple Massey product of [x],[y],[z] is {−[c]}. The graded space H∗(A) has a minimal A∞-structure with m3([x],[y],[z])=−[c] and all other higher products zero, and the explicit A∞ quasi-isomorphism below exhibits it as a minimal model.

Facts & Assumptions

Given: The field, basis, products, and differential specified in the Example.

[F1]

Cohomological differential graded algebra: a cohomological DGA has an associative degree-zero product, a degree-one square-zero differential, and d(ab)=d(a)b+(−1)∣a∣a d(b) for homogeneous a,b.

[F2]

Every field is a commutative ring with 1≠0; it is an integral domain, and it is a commutative division ring: the field k is a commutative ring, so the stated k-bilinear algebra is a DGA over an allowed base.

[F3]

A differential graded algebra is an A∞-algebra with no higher products: for a cohomological DGA, m1=d, m2 its product and mn=0 for n≥3 give an A∞-structure.

[F4]

Uncurved cohomological A∞-algebra in the unsuspended convention: the operations have degree 2−n and satisfy the displayed Stasheff identities with the fixed sign convention.

[F5]

A∞-morphism and quasi-isomorphism: Taylor maps of degrees 1−n satisfy the displayed all-arity morphism identity, with A∞ quasi-isomorphism detected by the first map on cohomology.

[F6]

Minimal A∞-model: a minimal model has m1=0 and an A∞ quasi-isomorphism to the given algebra.

[F7]

Triple Massey product with a fixed cohomological sign convention: in degree-zero inputs the representative is −av+uc when du=ab and dv=bc, with all representative and null-homotopy choices included.

[F8]

Koszul sign rule for graded tensor products and permutations: tensor maps use the graded Koszul sign rule.

Verification

1.1givenF1constructalgebra

The product is associative on triples involving the unit by the unit axiom. On nonunit basis elements, every nonzero pair product is one of a,b,c, each of which annihilates every nonunit. The only triple for which both adjacent pair-products are nonzero is (x,y,z); both (xy)z=az=0 and x(yz)=xb=0. If just one adjacent pair-product is nonzero, the iterated product is zero whichever pair is multiplied first. Hence the bilinear product is associative.

1.2givenF1algebra

The differential has degree +1: it sends u,v of degree −1 to a,b of degree zero and is zero on the other homogeneous basis elements. Since d(a)=d(b)=0, d2(u)=d2(v)=0, and d2 is zero on every other basis element as well.

1.3givenF5construct

Define f1:H∗(A)→A by the listed cocycle representatives, define f2([x],[y])=−u and f2([y],[z])=−v, and set f2=0 on all other basis pairs, in particular on pairs containing [1A]. Put fn=0 for n≥3. The degrees are ∣f1∣=0 and ∣f2∣=−1, as required by [F5].

2.1givenF1step 1.1algebra

For the unit pairs, the signed Leibniz rule follows from d(1A)=0. For the three nonzero nonunit products, both sides agree: d(xy)=0=d(x)y+x d(y), d(yz)=0=d(y)z+y d(z), and d(xv)=0=d(x)v+x d(v)=xb. If a nonunit product is zero and one factor is u or v, its differential is a or b, which annihilates every nonunit; the remaining term is zero because the other differential is zero. If neither factor is u nor v, both differentials vanish. Thus the signed Leibniz rule holds on basis pairs and hence, by bilinearity, on all homogeneous elements.

2.2givenstep 1.2algebra

The map d:A−1→A0 sends u↦a, v↦b, and c↦0. Its kernel is kc, its image is k{a,b}, and there is no degree −2 term. Also d vanishes on A0. Therefore H−1(A)=k[c], H0(A)=k[1A]⊕k[x]⊕k[y]⊕k[z], and all other cohomology groups are zero.

3.1F1F2F3step 1.1step 1.2step 2.1

By steps 1.1, 1.2 and 2.1 the multiplication and differential satisfy every DGA axiom in [F1], so A is a cohomological DGA. Its associated A∞-structure is the one of [F3].

3.2F1step 1.1step 2.2algebra

The DGA product descends to these cohomology classes: replacing a degree-zero cycle by a boundary changes it by a multiple of a or b, which multiplies every nonunit cycle to zero and multiplies the unit to a boundary; products involving [c] and a nonunit cycle are zero. The unit acts as [1A]. The only nonzero products among the chosen nonunit degree-zero representatives are xy=a=du and yz=b=dv, so their classes are zero. Thus every product in the reduced cohomology span k{[x],[y],[z],[c]} is zero.

3.3F1F7step 1.1step 1.2step 2.2algebra

The triple (x,y,z;u,v) is valid Massey data because xy=du=a and yz=dv=b. The fixed expression of [F7] is −xv+uz=−c+0=−c. Every representative of [x], [y], or [z] differs from that basis vector by an element of k{a,b}. Their adjacent products remain a and b, since a,b annihilate nonunit basis elements. Every null-homotopy of a is u+λc and every null-homotopy of b is v+μc for scalars λ,μ∈k. All correction products involving a,b,c in the expression vanish, so every datum representing these three classes gives −c. The triple Massey product is exactly {−[c]}.

4.1givenF4step 2.2step 3.2construct

On H∗(A), take m1=0 and let m2 be the induced product. Define m3([x],[y],[z])=−[c], let m3 be zero on every other ordered triple of the displayed basis, and set mn=0 for n≥4. The only nonzero value of m3 has degree 0+0+0−1=−1, as required by [F4].

4.2F1F5step 3.2step 1.3algebra

The arity-one morphism identity says df1=f1m1, and both sides are zero because the chosen representatives are cycles. In arity two, the identity is f1m2H=df2+μ(f1⊗f1). On the pairs ([x],[y]) and ([y],[z]), its right side is respectively −a+a=0 and −b+b=0; on all other pairs of nonunit basis classes both terms are zero. If an input is [1A], f2 is zero and f1 preserves the unit, so the equality holds there too.

5.1F4step 3.2step 4.1algebra

For arities n=1,2, the Stasheff sums vanish because m1=0. For n=3, the identity is associativity of m2: it holds on the unit by the unit law, and on three nonunit basis elements because their pairwise products are zero. Thus the identities hold through arity three.

5.2F5F8step 4.1step 1.3step 4.2algebra

In arity three, on ([x],[y],[z]) the left side is f1m3=−c, and the right side is μ(f1⊗f2)−μ(f2⊗f1)=x(−v)−(−u)z=−c. On every other triple of nonunit basis classes both sides are zero: m3 is zero there, and the only nonzero f2 values have products uz=0 or xv=c in precisely the triple already checked. If one input is the unit, the normalized condition f2(1A,−)=f2(−,1A)=0 makes the identity reduce to the unit law. For (1A,a,b) both sides equal f2(a,b); for (a,1A,b) both sides are zero; and for (a,b,1A) both sides equal −f2(a,b). With at least two units every f2 term is zero.

6.1F4step 4.1step 5.1algebra

In arity four, the only terms are insertions of m2 into m3 and of m3 into m2. On four nonunit basis inputs, the first terms vanish because m2 is zero on nonunit pairs; the second vanish because m3 outputs a multiple of [c] and m2([c],h)=m2(h,[c])=0 for nonunit h. If a unit occurs but the other three inputs are not [x],[y],[z] in that order, every m3 term is zero. For the four insertions of a unit into ([x],[y],[z]), the cancellations in the arity-four sum are respectively (−[c])+[c], (−[c])+[c], [c]−[c], and (−[c])+[c]: they come from m3(m2(1A,x),y,z) paired with −m2(1A,m3(x,y,z)), m3(m2(x,1A),y,z) paired with −m3(x,m2(1A,y),z), −m3(x,m2(y,1A),z) paired with m3(x,y,m2(1A,z)), and m3(x,y,m2(z,1A)) paired with −m2(m3(x,y,z),1A). With two or more units every term vanishes by the prescribed zero values of m3. Hence the arity-four sum is zero on every basis quadruple and therefore on all inputs.

6.2F5step 1.3step 5.2algebra

In arity four, the only possible left terms apply f2 to an m3 output, which is a multiple of [c] and is sent to zero by f2. The only possible right term with nonzero Taylor maps is a product of two f2 outputs; all products among u,v are zero. For n≥5, the left side requires an input operation of arity at most three and an outer f of arity at most two, so n≤4; the right side requires a target operation of arity at most two and each fi of arity at most two, again so n≤4. All morphism identities in arities n≥4 therefore hold.

7.1F5step 2.2step 1.3step 4.2step 5.2step 6.2

The map f1 sends the basis [1A],[x],[y],[z],[c] of H∗(A) to representatives of the same cohomology basis computed in step 2.2. It therefore induces an isomorphism on cohomology, so f is an A∞ quasi-isomorphism.

7.2F4step 4.1step 5.1step 6.1algebra

In arity five, the only possible nonzero composition is m3 inserted into m3; its inner output is a multiple of [c], on which the outer m3 is zero. For n≥6, a nonzero summand would require both inner and outer arities at most three, forcing n to be at most five. Thus every higher Stasheff sum vanishes. Together with the arity-four verification, these establish the stated minimal A∞-structure on H∗(A).

8.1F6step 3.3step 7.2step 7.1∎

By [F6], the A∞-algebra H∗(A) with m1=0 and the morphism f is a minimal A∞-model for A. Its value m3([x],[y],[z])=−[c] is the unique triple Massey product computed in step 3.3.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

25 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