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.

Controlled transforms preserve maximal order on nonempty transformed schemes

Statement

Let (I,E,μ) be a marked ideal of maximal order (Marked ideals of maximal order, tangent directions and transversality to the exceptional divisors) and let C⊆supp⁡(I,E,μ) be a regular center with SNC with E, with blowup σ ⁣:X′→X (Multiple test blow-ups, controlled transforms and resolutions of marked ideals). Then the controlled transform has order at most μ at every point of X′. If X′≠∅, it is nonzero and hence again of maximal order. If X′=∅ (possible for μ=0 and a whole-space center), the order bound is vacuous; the definition requiring a nonzero ideal does not apply.

Facts & Assumptions

Given: A marked ideal (I,E,μ) of maximal order, a regular center C⊆supp⁡(I,E,μ) with SNC with E, and the blowup σ ⁣:X′→X.

[F1]

Marked ideals of maximal order, tangent directions and transversality to the exceptional divisors: maximal order means ord⁡x(I)≤μ at every point; since C⊆supp⁡(I,μ), equality holds at every x∈C. The derivative characterization is restricted to characteristic zero or the safe range p>μ and is not used here.

[F2]

Multiple test blow-ups, controlled transforms and resolutions of marked ideals: a test blow-up has a regular center contained in the support, is an isomorphism off that center, and has controlled transform I(D)−μσ∗I, locally y−μσ∗(I) for an exceptional equation y.

Proof

1.1F1F2

If μ=0, maximal order forces I=OX, so the controlled transform is OX′, of order zero at every point. On a nonempty X′ it is nonzero; on the empty scheme the asserted order bound is vacuous. Now assume μ≥1. Off the exceptional divisor the blow-up is an isomorphism, so the controlled transform has order at most μ there. It remains to check points over C.

2.1F1F2step 1.1∎

Fix c∈C and write the regular center locally as J=IC=(x1,…,xq) in regular coordinates transverse to C, with additional coordinates along C. Since every point of C has ord⁡c(I)=μ, I⊆Jμ near C by Controlled transforms are well defined. The normal associated-graded ring is a polynomial ring over OC, by Associated graded algebra of an ideal generated by a regular sequence. At each c, equality of the order gives some f∈I whose initial transverse form F∈Sym⁡μ(J/J2)⊗κ(c) is nonzero. In any blow-up chart over c with exceptional equation y=xj, the restriction of y−μσ∗(f) to the exceptional fiber is the nonzero dehomogenization of F, a polynomial of degree at most μ. Its order at any point of that fiber is at most μ. Indeed, for a nonzero polynomial P of total degree d≤μ, choose a nonzero top-degree monomial cZα. The Hasse derivative of index α is the nonzero constant c. Hasse derivatives extend to the local polynomial ring by substituting Z↦Z+T and inverting denominators as formal series. Their higher Leibniz rule sends mN into mN−∣α∣, because at most ∣α∣ factors of a product can receive positive derivative index. Thus P∈md+1 would force the unit c into m, a contradiction. This establishes the degree bound at every prime and in every characteristic; the order of the full local section is no greater than that of its restriction. Thus the controlled transform has order at most μ at every point over C, and is nonzero when X′≠∅, since the zero ideal at any point has infinite order. This proves the stated maximal-order conclusion with its empty-scheme qualification.

Depends on

Used by

Dependency tree · two levels

44 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