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.
Depth is additive for a flat local homomorphism
Statement
Assume the Axiom of Choice. For a flat local homomorphism of Noetherian local rings,
Facts & Assumptions
Given: The Axiom of Choice and a flat local map of Noetherian local rings. All depths are finite because the three local rings/modules are nonzero Noetherian objects. Choice is used through the regular-sequence lifting and quotient-flatness theorem (A flat local map splits regular sequences into base and fibre parts, The Axiom of Choice).
Proof
Write and . Choose regular sequences of these finite maximal lengths. Under the stated Choice hypothesis, A flat local map splits regular sequences into base and fibre parts lifts their concatenation to an -regular sequence, giving .
We prove the reverse inequality by induction on , following Stacks Project, Tag 0338. If , the depth-zero criterion supplies with . Flatness makes , , injective. Choose a nonzero closed-fibre element annihilated by . Then and , so the depth-zero criterion gives .
If , choose an -regular . Flatness makes -regular, and the repaired split lemma gives flat local with the same closed fibre. Induction and Depth drops by one after quotienting by a regular element give . If instead , lift a closed-fibre regular element to . The split lemma makes regular on and, crucially, makes flat over ; its closed fibre has depth . Induction again gives . The only use of Choice in these branches is through that split lemma. Thus in all cases .
Depends on
Used by
Dependency tree · two levels
18 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
- Depth and Cohen--Macaulay modules source treatment (standard reference, not scraped)