Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
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.

Addition and multiplication of marked ideals

Statement

Let (X,E) be a smooth K-scheme with a fixed family E in simultaneous SNC position, and let (I,μI), (J,μJ), (I1,μ1),…,(Im,μm) be marked ideals on X with common E (Marked ideals and their support). All marks are nonnegative. For the sum operation below require every summand mark to be positive; the product operation permits zero marks. For assertion (1), assume the Axiom of Choice; assertion (2) and its proof are choice-free.

For positive marks define

(I,μI)+(J,μJ):=(IμJ+JμI, μIμJ),

and inductively

(I1,μ1)+⋯+(Im,μm):=(∑j=1mIj∏k≠jμk, ∏kμk).

For nonnegative marks define

(I,μI)⋅(J,μJ):=(IJ, μI+μJ).

(1) For any m≥1, the support of the sum is ⋂jsupp⁡(Ij,μj). Its multiple test blow-ups are exactly the simultaneous multiple test blow-ups of all summands, and controlled transforms commute with sums:

(I1,μ1)i+⋯+(Im,μm)i=[(I1,μ1)+⋯+(Im,μm)]i

at every stage i.

(2) The product satisfies

supp⁡(I,μI)∩supp⁡(J,μJ)⊆supp⁡(IJ,μI+μJ).

Every simultaneous multiple test blow-up of (I,μI) and (J,μJ) is a multiple test blow-up of their product, and

(Ii,μI)⋅(Ji,μJ)=[(I,μI)⋅(J,μJ)]i

at every such stage.

Under the AC hypothesis in (1), the sum is not associative on the nose, but its two bracketings are equivalent in the sense of Equivalence of marked ideals.

Facts & Assumptions

Given: The smooth K-scheme, common SNC boundary, marked ideals, and weight ranges stated above. Assertion (1) is under AC; assertion (2) has no choice assumption.

[A1]

The Axiom of Choice: AC is used in assertion (1) through the associated-graded theorem for regular local rings; no choice is used in assertion (2).

[F1]

Marked ideals and their support, Order of an ideal sheaf at a point: supp⁡(A,ν)={x:ord⁡x(A)≥ν}, with ord⁡x(A)=+∞ for the zero ideal and finite order attained for nonzero ideals.

[F2]

Tensor product of sheaves of modules: products and powers of ideal sheaves are formed by multiplying local sections.

[F3]

Multiple test blow-ups, controlled transforms and resolutions of marked ideals: a multiple test blow-up has regular centers in the successive supports meeting the successive boundaries with SNC; its controlled transform is σc(A,ν)=(I(D)−νσ∗A,ν).

[F4]

Equivalence of marked ideals: two marked ideals with the same ordered boundary are equivalent when their supports and all multiple test blow-ups, with induced supports, agree.

[F5]

Smooth morphism of schemes, Geometrically regular algebras and geometrically regular fibres: for every x∈X, the local ring OX,x is a regular local ring, since X→Spec⁡K is smooth.

[F6]

Under AC, associated graded ring of a regular local ring identifies gr⁡mx(OX,x) with a polynomial algebra over its residue field; in particular, this associated-graded ring is a domain.

Proof

1.1A1F1F5F6

Order calculus. Work at x∈X, with R=OX,x and maximal ideal m. For ideals A,B⊆R, ord⁡x(A+B)=min⁡(ord⁡xA,ord⁡xB): containment of both ideals in A+B gives one inequality, and A+B⊆mn forces both into mn. Always ord⁡x(AB)≥ord⁡xA+ord⁡xB by multiplying ideal containments. For assertion (1), if A≠0 has finite order a, choose f∈A∖ma+1; its initial class in gr⁡mR is nonzero by [F1]. By [A1], [F5], and [F6], the associated-graded ring is a domain, so the initial class of fk is nonzero in degree ka; hence ord⁡x(Ak)=ka, since the reverse inequality follows from A⊆ma. The zero ideal has infinite order and its positive powers are zero, so the identity also holds there.

2.1F1step 1.1

Supports. Put μ=∏jμj and ej=∏k≠jμk, all positive. By step 1.1, ord⁡x(∑jIjej)=min⁡jejord⁡x(Ij). This is at least μ exactly when every ord⁡x(Ij)≥μj, giving the support intersection in (1). For (2), if x is in both factor supports, then ord⁡x(I)+ord⁡x(J)≥μI+μJ; the product lower bound in step 1.1 puts x in the product support. This proves the stated reverse-direction inclusion, including zero marks.

3.1F2F3step 2.1

Transform identities. For a blow-up with exceptional equation y and center in the support of the sum, step 2.1 places that center in every summand support. Writing Ij,i=y−μjσ∗Ij, we have y−μσ∗(∑jIjej)=∑j(y−μjσ∗Ij)ej=∑jIj,iej because ejμj=μ. For the product, at any simultaneous admissible center, y−(μI+μJ)σ∗(IJ)=(y−μIσ∗I)(y−μJσ∗J). Thus the corresponding controlled transforms agree. These are ideal-sheaf identities and use no choice.

4.1F3step 2.1step 3.1

Test blow-ups. The support equality in step 2.1 and transform identity in step 3.1 show inductively that a sequence is a multiple test blow-up of the sum exactly when each center is simultaneously admissible for every summand; all transformed supports agree at each stage. For the product, simultaneous admissibility puts each center in the intersection of factor supports and hence, by step 2.1, in the product support; the product transform identity then gives the induction that every simultaneous test sequence is a product test sequence.

5.1F4step 2.1step 4.1∎

Associativity of the sum. For either bracketing of three or more summands, step 2.1 identifies the initial supports and step 4.1 identifies the multiple test blow-ups and induced supports. The two bracketings therefore satisfy the equivalence criterion [F4], although their defining ideal sheaves need not be equal. This proves the final assertion.

Depends on

Used by

Dependency tree · two levels

45 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