Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-sol)audited 2026-09-30
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 A be a commutative ring, let B=A[x0,…,xn] be graded by total degree, n≥0, let b=(x0,…,xn)=B+ be the irrelevant ideal, and let I⊆B be a homogeneous ideal. Write Isat=⋃r≥0(I:br)={ h∈B  :  brh⊆I for some r≥0 } for the saturation of I with respect to b, and put X=Proj⁡B=PAn with standard charts D+(xi)=Spec⁡B(xi) (Projective space is Proj of a polynomial ring).

Then:

  1. For a homogeneous h∈B of degree d one has h∈Isat if and only if h/xid lies in the degree-zero part (I[xi−1])0 of the localised ideal, inside (B[xi−1])0=A[x0/xi,…,xn/xi], for every i=0,…,n.
  2. Consequently I and Isat define the same ideals on every chart: ((Isat)[xi−1])0=(I[xi−1])0 for every i.
  3. Two saturated homogeneous ideals I,J⊆B (that is, I=Isat, J=Jsat) with (I[xi−1])0=(J[xi−1])0 for all i are equal. In particular the chart ideals determine I uniquely.

The case n=0, where there is a single chart D+(x0)=Spec⁡A and b=(x0), is included.

Facts & Assumptions

Given: A commutative ring A, the graded polynomial ring B=A[x0,…,xn] with n≥0, a homogeneous ideal I⊆B, the ideal b=(x0,…,xn), and the Axiom of Choice as inherited from the Proj construction.

[A1]

The Axiom of Choice states that every family of nonempty sets has a choice function. (The Axiom of Choice)

[F1]

The chart D+(xi) of Proj⁡B=PAn is Spec⁡B(xi) with B(xi)=A[x0/xi,…,xn/xi], the variable xi/xi being the unit, and the charts cover X. (Projective space is Proj of a polynomial ring)

[F2]

For a graded B-module M and homogeneous f of positive degree, Γ(D+(f),M~)=M(f), the ideals on charts being the degree-zero parts of the localised ideals; in particular the ideal of D+(xi) cut out by a homogeneous ideal I is (I[xi−1])0. (Sections of a graded-module sheaf on a standard open)

Proof

technique · direct: translate chart membership into divisibility data, convert finitely many divisibility conditions into one power of the irrelevant ideal by a pigeonhole count over monomials, and compare two saturated ideals chart by chart
1.1F2algebra

Chart membership is a divisibility condition. Let h∈B be homogeneous of degree d and fix i. Because a homogeneous ideal is generated by its homogeneous elements, the condition h/xid∈(I[xi−1])0 means that there are k≥0 and c∈I homogeneous of degree k with h/xid=c/xik in B[xi−1], and equality of these fractions means that xiN(xikh−xidc)=0 for some N≥0. Multiplication by the polynomial variable xi is injective on B=A[x0,…,xn] for every coefficient ring A, because it shifts the A-basis of monomials injectively; hence xikh=xidc. If k≥d, cancellation gives xik−dh=c∈I; if k<d, it gives h=xid−kc∈I. Conversely either containment xik′h∈I represents h/xid by an element of (I[xi−1])0. Thus chart membership is equivalent to xik′h∈I for some k′≥0, without assuming A is a domain.

1.2algebra

From chart conditions to one power of b. Suppose h is homogeneous of degree d and xirih∈I for every i with 0≤ri<∞. Put r=r0+⋯+rn. Every monomial x0a0⋯xnan of total degree r has some ai≥ri: otherwise ai≤ri−1 for all i would give r=∑ai≤∑(ri−1)=r−(n+1)<r. For such an i the product equals xiai−ri⋅(xirih)∈I, since xirih∈I and I is an ideal; a monomial with total degree r times h is precisely one of these products. As br is spanned by the monomials of total degree r, we get brh⊆I, hence h∈Isat.

2.1step 1.1step 1.2algebra

The saturation criterion. If h∈Isat then brh⊆I for some r, and in particular xirh∈I for every i, so step 1.1 gives h/xid∈(I[xi−1])0 for every i. Conversely, if h/xid∈(I[xi−1])0 for every i, then step 1.1 provides exponents ri with xirih∈I, and step 1.2 gives brh⊆I for r=∑iri, that is h∈Isat. This is claim (1) as stated for homogeneous h. Since I and Isat are homogeneous ideals, their membership for an arbitrary polynomial can also be checked componentwise.

3.1step 2.1algebra

Same chart ideals. Since I⊆Isat, we have (I[xi−1])0⊆((Isat)[xi−1])0. Conversely let g/xik∈((Isat)[xi−1])0 with g∈Isat homogeneous of degree k; then xisg∈I for some s≥0 by definition of Isat, so g/xik=(xisg)/xik+s∈(I[xi−1])0, giving the reverse inclusion and claim (2).

3.2step 2.1algebra

Saturated ideals with equal charts are equal. Let I,J be saturated homogeneous ideals with (I[xi−1])0=(J[xi−1])0 for all i, and let h∈I be homogeneous. By step 2.1 applied with Isat=I, the element h satisfies h/xid∈(I[xi−1])0=(J[xi−1])0 for all i of the same degree d=deg⁡h, so step 2.1 applied with Jsat=J gives h∈J. Hence I⊆J, and symmetrically J⊆I; this is claim (3).

4.1

Conclusion. Steps 1.1, 1.2 and 2.1 prove the chartwise saturation criterion (1), step 3.1 identifies the chart ideals of I and Isat, and step 3.2 shows that a saturated homogeneous ideal is determined by its chart ideals. For n=0 the index set is {0}, the pigeonhole count in step 1.2 reduces to r=r0, and all statements read x0rh∈I on the single chart D+(x0)=Spec⁡A 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