Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedPipeline-generatedjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)
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.

The tau level adds under the filtered tensor product

Statement

Let C and D be finite integer-filtered chain complexes over F2, with increasing bounded exhaustive filtrations by subcomplexes and with H(C)≅H(D)≅F2. Give C⊗D the tensor differential and the convolution filtration Fs(C⊗D)=∑p+q≤sFpC⊗FqD. Then H(C⊗D)≅F2 and τ(C⊗D)=τ(C)+τ(D).

Facts & Assumptions

Given: The complexes C,D and their filtrations as in the Statement.

[F1]

The Alexander filtration and tau level: τ(C) is the least integer s for which H(FsC)→H(C) has nonzero image, when H(C)≅F2.

Proof

1.1F1givenconstructalgebra

Write t=τ(C) and u=τ(D). For each degree n, let Bn=im⁡(∂n+1) and Zn=ker⁡(∂n). Finite-dimensional linear algebra gives complements Hn,Ln with Zn=Bn⊕Hn and Cn=Zn⊕Ln; the differential maps Ln isomorphically onto Bn−1. Thus each complex is the direct sum of homology representatives with contractible two-term complexes. If h contracts one such summand A, then h⊗1 contracts A⊗E: the two cross terms cancel by the graded tensor signs, while (∂h+h∂)⊗1=1. Hence H(C⊗D)≅H(C)⊗H(D)≅F2. By [F1], choose cycles x∈FtC and y∈FuD representing the nonzero homology classes. Their tensor is a nonzero class in H(C⊗D) and lies in Ft+u(C⊗D), so τ(C⊗D)≤t+u.

2.1F1step 1.1givenconstructalgebra∎

Let n be the homological degree of [x]. The image of H(Ft−1C) in H(C) is zero by minimality of t, so every cycle in Ft−1Cn is a boundary in C. The cycle x cannot lie in Bn+Ft−1Cn; otherwise x=b+v would make v=x−b a cycle in Ft−1C representing the same nonzero class. Extend the linear functional that is zero on Bn+Ft−1Cn and one on x to a functional λ:Cn→F2. It vanishes on boundaries, so is a cocycle. Construct μ on the homological degree of y in D in the same way. The tensor cocycle λ⊗μ evaluates to one on x⊗y and vanishes on every Ft+u−1(C⊗D): each summand FpC⊗FqD with p+q≤t+u−1 has either p<t or q<u. Therefore no class in that lower filtration maps to the nonzero total homology class, and τ(C⊗D)≥t+u. Together with step 1.1 this proves equality.

Depends on

Used by

Dependency tree · two levels

5 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