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.
Semilocal completion decomposes into completed local factors
Example
Let be a Noetherian commutative ring, let , and let be distinct maximal ideals. Set
Then the -adic completion of decomposes as
Facts & Assumptions
Given: A Noetherian commutative ring , an integer , pairwise distinct maximal ideals , and .
Completion is the inverse limit of the residue rings modulo the powers of the defining ideal (The -adic completion of a module).
Pairwise comaximal ideals give a product decomposition modulo their intersection (Chinese remainder theorem for pairwise comaximal ideals).
Verification
Distinct maximal ideals are pairwise comaximal. If , expanding for , , and shows that ; hence the powers are again pairwise comaximal. Applying [L2] first to the and then to their powers gives, for every , and
Localizing at changes nothing. Indeed, if , maximality gives and with , and Thus every such is already a unit modulo , and Taking inverse limits and using [L1] yields
A compatible tuple in the inverse limit of the finite products in step 2.1 is exactly a choice, for each , of a compatible tuple in the th quotient tower. Therefore inverse limit commutes with this finite product, and This is the claimed decomposition.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
11 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
- A. Altman and S. Kleiman, A Term of Commutative Algebra, 13th ed., Exercise 22.15 (standard reference, not scraped)
- The Stacks Project, Lemma 10.97.8 (standard reference, not scraped)