Alphabeta Math
LemmaStatement: AI-generatedProof: AI-generated
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.

Graded pieces of a direct-sum tail tower

Statement

Let (Gj)j≥0 be spectra and put Tq=⨁j≥qGj for q≥0, with Tq=T0 for q≤0. Give these spectra the canonical tail inclusions and augmentation to T0. Then gr⁡qT≃Gq for q≥0, the connecting map Gq→Tq+1[1] is zero, and gr⁡qT≃0 for q<0. The identifications are natural in maps of families (Gj).

Facts & Assumptions

Given: The family of spectra and its augmented tail tower.

Goal: Compute its graded pieces and connecting maps.

[F1]

Decreasing spectral filtrations and associated graded defines the associated graded as a cofiber.

[F2]

Cofiber of a direct-summand inclusion computes the cofiber and connecting map of a summand inclusion.

Proof

1.1F1F2givenconstruct

For q≥0, the universal property of coproducts gives a natural equivalence Tq≃Tq+1⊕Gq carrying the transition map to the first-summand inclusion. Applying [F2] gives the stated graded piece and zero connecting map.

2.1F1givenstep 1.1∎

For q<0 the transition map is the identity of T0, whose cofiber is zero. The coproduct decompositions, inclusions and projections commute with maps of families, so the identifications are natural.

Depends on

Used by · 3

Dependency tree · 3 levels

Arrows run from prerequisites to the items that use them. External source nodes link directly to the cited text. The view shows up to three dependency steps; open a prerequisite to continue.