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.

Order functions and normal-crossings strata are upper semicontinuous

Statement

Assume AC (The Axiom of Choice) and let K be perfect. Let X be a smooth K-scheme, I⊆OX a nonzero coherent ideal sheaf and E a finite family of divisors in simultaneous SNC position (Simple normal crossings divisors and simultaneous normal crossings position). (1) The function x↦ord⁡x(I) is upper semicontinuous: for every k≥1 the set {x:ord⁡x(I)≥k} is closed. If char⁡K=0 or char⁡K=p≥k, then this set equals V(Dk−1(I)) (Iterated derivative ideals preserve support in the safe characteristic range). (2) The function sE(x):=#{D∈E:x∈D} is upper semicontinuous and locally constant on the finite stratification of X by the sets of members of E through a point; for every k the set {x:sE(x)≥k} is a finite union of closed subsets, hence closed. (3) A finite lexicographic tuple of upper semicontinuous functions with locally finite ranges is upper semicontinuous; so is a finite maximum of such tuples. Application to the piecewise-defined resolution invariants requires the branchwise induction in the canonical-resolution proposition below (source Proposition 3.0.8), rather than following merely from a definition.

Facts & Assumptions

Given: A smooth K-scheme X, a nonzero coherent ideal sheaf I⊆OX, and a finite family E of divisors in simultaneous SNC position.

[F1]

Iterated derivative ideals preserve support in the safe characteristic range: for every k≥1, supp⁡(I,k)={x:ord⁡xI≥k} is closed over the perfect field K in every characteristic. In characteristic zero or characteristic p>k, it equals V(Dk−1(I)); the endpoint case p=k is proved directly in step 1.1.

[F2]

Simple normal crossings divisors and simultaneous normal crossings position: at every point p the components of the members of E through p are cut out by pairwise distinct elements of a regular system of parameters of OX,p; in particular each member D of E has a zero locus that is closed, and only finitely many members pass through a given point.

[F3]

Upper semicontinuity for a function to a linearly ordered set means that {x:f(x)≥a} is closed for every threshold a in that order. In particular, for integer- or rational-valued functions it is not enough to check integer thresholds unless the range is known to lie in a discrete sublattice.

[F4]

Locally Noetherian and Noetherian schemes, Coherent module sheaves, Iterated derivative ideals preserve support in the safe characteristic range: on a quasi-compact Noetherian open, for any coherent ideal J the closed order-superlevel sets {x:ord⁡x(J)≥k} descend with k and therefore stabilize, by the perfect-field closedness in [F1] (the zero ideal gives the whole open at every level). The order consequently has only finitely many finite values there, together with the value +∞ on the stable intersection. No derivative-ideal equality is used for this bound.

[F6]

Finite lexicographic assembly preserves upper semicontinuity under the local finite-range bounds just established. For two coordinates f,g with finite local ranges, the lexicographic superlevel set at (a,b) is {f>a}∪({f=a}∩{g≥b}). The first set is a finite union of closed superlevel sets; any limit point of the second either has f>a or has f=a and g≥b, since both superlevel sets are closed. Induction gives the result for every finite tuple. A finite maximum of such tuples is upper semicontinuous because its superlevel set is the union of the component superlevel sets.

Proof

1.1F1F3

The order function is upper semicontinuous and the derivative formula holds in the stated range. The superlevel set for k is closed by [F1] in every characteristic. If char⁡K=0 or p>k, the formula with V(Dk−1(I)) is [F1]. For the remaining safe endpoint p=k, first suppose ord⁡x(I)≥k. Every coordinate derivative of order r≤k−1 lowers order by at most r, so Dk−1(I)x⊆mx and x∈V(Dk−1(I)). If instead j:=ord⁡x(I)<k, choose f∈Ix with order j and a nonzero monomial cUα in its degree-j initial form. Then ∣α∣=j≤k−1 and ∂αf has nonzero residue cα! in κ(x), since every factor in α! is less than p=k. This derivative lies in Dk−1(I)x, so that ideal is a unit at x and x∉V(Dk−1(I)). Thus the formula holds also for p=k, proving assertion (1).

1.2F2F3

The normal-crossings count is upper semicontinuous. For a finite set J of members of E the set {x:x∈D for all D∈J}=⋂D∈JD is closed by [F2], and {x:sE(x)≥k} is the finite union of these intersections over the k-element subsets J; hence it is closed, and the function is upper semicontinuous. On the locally closed stratum where exactly the members of J pass through the point, sE is constant equal to ∣J∣; these finitely many strata cover X locally because E is finite and its members have SNC, so only finitely many subsets occur locally at a point [F2]. This is assertion (2).

2.1F3F4F6algebra∎

Work on an open neighbourhood where f,g have finite ranges; the order functions satisfy this bound by [F4]. For a lexicographic threshold (a,b), the superlevel set is {f>a}∪({f≥a}∩{g≥b}). Since f has finite range locally, {f>a} is a finite union of closed superlevel sets, and the second set is closed by upper semicontinuity. Thus this union is closed. Induction gives the same result for a finite tuple; the superlevel set of a finite maximum is the finite union of the corresponding closed sets. This proves (3). It makes no claim that an unspecified piecewise assembly has satisfied these hypotheses.

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