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.

Derivative ideals of a maximal-order marked ideal have maximal order

Statement

Assume μ≥1 and either char⁡K=0 or K perfect with char⁡K=p>μ (Field). If (I,E,μ) is a marked ideal of maximal order, then for every 0≤i≤μ, the derivative marked ideal Di(I,μ)=(Di(I),μ−i) is of maximal order (Derivative ideals of an ideal sheaf and of a marked ideal).

Facts & Assumptions

Given: A field K, a maximal-order marked ideal (I,E,μ) with μ≥1, and either char⁡K=0 or K perfect with char⁡K=p>μ.

[F1]

Marked ideals of maximal order, tangent directions and transversality to the exceptional divisors: In characteristic zero or perfect characteristic p>ν, for a marking ν≥1, maximal order is equivalent to Dν(A)=OX.

[F2]

Derivative ideals of an ideal sheaf and of a marked ideal: Di(I,μ)=(Di(I),μ−i) and the recursive definition gives Da(Db(I))=Da+b(I) in every characteristic.

Proof

1.1F1F2given

By maximality and the safe-characteristic hypothesis, Dμ(I)=OX by [F1]. For 0≤i≤μ, the recursive identity in [F2] gives Dμ−i(Di(I))=Dμ(I)=OX.

2.1F1F2step 1.1∎

If μ−i≥1, the field remains in characteristic zero or has p>μ≥μ−i, so [F1] implies that Di(I,μ) is of maximal order. If i=μ, its residual marking is zero and its ideal is OX, which is maximal order directly. This proves the assertion for every i.

Depends on

Used by

Dependency tree · two levels

18 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