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.
Every exact couple is a long exact sequence with no extra grading data
Statement
False: An ungraded long exact sequence, without additional grading and repeated-object data, determines the specified homological exact-couple spectral sequence.
Facts & Assumptions
Exact couple requires the bigraded objects and degrees , , in an initial couple, in addition to three exactness conditions.
Abelian-group model for spectral-sequence computations proves that multiplication by on is injective, with image and cokernel .
Refutation
Given: The ungraded long exact sequence with nonzero terms , , , maps multiplication by and reduction modulo , and for every other integer . All other maps are zero.
This sequence is exact: multiplication by is injective, its image is the kernel of reduction, and reduction is surjective. Exactness at every zero term is equality of zero subgroups.
For each define and when , and zero otherwise. Let be multiplication by on supported components, reduction on supported components, and the zero map to its prescribed target . All off-support maps are zero. The shift preserves support, and has degree . At supported , and ; at supported , . At off-support targets each required image and kernel is zero, including any zero map from a supported source. Thus these are initial exact couples with exactly the degrees in [F1].
To specify the underlying long exact sequences without dropping zero terms, fix any integer . Following in the -couple gives, for every integer , the consecutive terms . The last term is the first term for . Assign the first three terms sequence positions . Their total bidegree is , so they are nonzero exactly when . Forgetting bidegrees therefore gives exactly the sequence of step 1.1, for both and , for every . In particular the zero target of each supported remains a zero term. No sum of the indexed families is being taken.
The two pages differ: whereas . Hence they cannot be isomorphic by bidegree-zero maps. Even the displayed collection of underlying long exact sequences is identical in the two constructions, while their specified first spectral pages are different. Thus the ungraded sequence does not determine the specified homological exact-couple spectral sequence; bidegree allocation is essential extra data. This asserts neither failure of ungraded exactness nor a convergence statement, and uses no choice.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
3 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
- Weibel, An Introduction to Homological Algebra, Chapter 5 (standard reference, not scraped)
- The Stacks Project, Homological Algebra (standard reference, not scraped)