Alphabeta Math
False statementConstruction: AI-adaptedVerification: AI-adaptedPipeline-generatedaudited 2026-09-12
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.

E r plus one is literally equal to the homology of e r

Statement

It is false that literal equality Er+1=H(Er) is required in the definition of a spectral sequence.

Facts & Assumptions

Given: The tagged two-element groups Gr, with their transported operations.

[F1]

The definition supplies isomorphisms H(Er)Er+1 (Homological spectral sequence).

[F2]

ℤ/2 and copies with transported addition are abelian-group objects (Abelian-group model for spectral-sequence computations).

Refutation

technique · direct
1.1

For each r≥0 put Gr={(r,a):aZ/2} with (r,a)+(r,b)=(r,a+b). Put Gr at (0,0), zero elsewhere and let every differential be zero. The group laws follow immediately by transport from [F2]. Model its homology quotient as the set of singleton cosets {{(r,a)}:aZ/2}.

F1F2
2.1

Define αr({(r,a)})=(r+1,a). It is additive and has inverse (r+1,a){(r,a)}, giving the exact data of [F1]. These homology elements are singleton sets, whereas ordered pairs (in the standard set model (x,y)={{x},{x,y}}) at r+1 have two elements as soon as r+1 differs from a. This occurs for some a since ℤ/2 has two distinct elements. Therefore this chosen model of H(Gr) is not literally Gr+1, although αr is an isomorphism.

F1F2step 1.1

Source notes

Weibel, Chapter 5, §5.2 pp.122–125 and Definitions 5.4.2–4 pp.132–133; Sharifi, §4.1 pp.87–89 and Definition 4.2.1 p.90.

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