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.
Saturation detected on projective charts
Statement
Assume the Axiom of Choice as inherited from the Proj construction (The Axiom of Choice). Let be a commutative ring, let be graded by total degree, , let be the irrelevant ideal, and let be a homogeneous ideal. Write for the saturation of with respect to , and put with standard charts (Projective space is Proj of a polynomial ring).
Then:
- For a homogeneous of degree one has if and only if lies in the degree-zero part of the localised ideal, inside , for every .
- Consequently and define the same ideals on every chart: for every .
- Two saturated homogeneous ideals (that is, , ) with for all are equal. In particular the chart ideals determine uniquely.
The case , where there is a single chart and , is included.
Facts & Assumptions
Given: A commutative ring , the graded polynomial ring with , a homogeneous ideal , the ideal , and the Axiom of Choice as inherited from the Proj construction.
The Axiom of Choice states that every family of nonempty sets has a choice function. (The Axiom of Choice)
The chart of is with , the variable being the unit, and the charts cover . (Projective space is Proj of a polynomial ring)
For a graded -module and homogeneous of positive degree, , the ideals on charts being the degree-zero parts of the localised ideals; in particular the ideal of cut out by a homogeneous ideal is . (Sections of a graded-module sheaf on a standard open)
Proof
Chart membership is a divisibility condition. Let be homogeneous of degree and fix . Because a homogeneous ideal is generated by its homogeneous elements, the condition means that there are and homogeneous of degree with in , and equality of these fractions means that for some . Multiplication by the polynomial variable is injective on for every coefficient ring , because it shifts the -basis of monomials injectively; hence . If , cancellation gives ; if , it gives . Conversely either containment represents by an element of . Thus chart membership is equivalent to for some , without assuming is a domain.
From chart conditions to one power of . Suppose is homogeneous of degree and for every with . Put . Every monomial of total degree has some : otherwise for all would give . For such an the product equals , since and is an ideal; a monomial with total degree times is precisely one of these products. As is spanned by the monomials of total degree , we get , hence .
The saturation criterion. If then for some , and in particular for every , so step 1.1 gives for every . Conversely, if for every , then step 1.1 provides exponents with , and step 1.2 gives for , that is . This is claim (1) as stated for homogeneous . Since and are homogeneous ideals, their membership for an arbitrary polynomial can also be checked componentwise.
Same chart ideals. Since , we have . Conversely let with homogeneous of degree ; then for some by definition of , so , giving the reverse inclusion and claim (2).
Saturated ideals with equal charts are equal. Let be saturated homogeneous ideals with for all , and let be homogeneous. By step 2.1 applied with , the element satisfies for all of the same degree , so step 2.1 applied with gives . Hence , and symmetrically ; this is claim (3).
Conclusion. Steps 1.1, 1.2 and 2.1 prove the chartwise saturation criterion (1), step 3.1 identifies the chart ideals of and , and step 3.2 shows that a saturated homogeneous ideal is determined by its chart ideals. For the index set is , the pigeonhole count in step 1.2 reduces to , and all statements read on the single chart of [F1], so the case is included. The Axiom of Choice [A1] is inherited from the Proj construction and is not used again. [A1, F1, step 1.2, step 2.1, step 3.1, step 3.2, cases: n=0] \qed
Depends on
Used by
Dependency tree · two levels
14 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, Constructions of Schemes, Sections 27.8-27.21 (standard reference, not scraped)
- Ravi Vakil, The Rising Sea, 29 August 2022, Sections 4.5, 7.4, 9.3, 10.6, 17.4, 17.6, 18.2 (standard reference, not scraped)