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.
Regular Sequence First Element Boundary
Statement
A nonempty -regular sequence has , has first element a non-zero-divisor on , and has nonzero terminal quotient; thus neither a unit nor a zero module satisfies the adopted nonempty convention.
Facts & Assumptions
Given: The rings, finite sequences, modules, and local hypotheses stated in the claim. The declared prerequisites used here are Regular Sequence On A Module.
Proof
At the first stage the definition requires injectivity of on .
It also requires all stage quotients, especially and the terminal quotient, to be nonzero; units and therefore fail.
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
- The Stacks Project, Koszul complexes and regular sequences (standard reference, not scraped)