Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-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.

Canonical resolutions with invariants of a marked ideal

Definition

Let (I,E,μ) be a marked ideal on a smooth K-scheme X of finite type (Marked ideals and their support). A canonical resolution of (I,E,μ) is a resolution (Xi)0≤i≤m, X0=X, together with functions inv⁡ ⁣:supp⁡(Ii,Ei,μ)→Q≥0×Q≥0∞,ν ⁣:supp⁡(Ii,Ei,μ)→Q≥0,ρ ⁣:supp⁡(Ii,Ei,μ)→Sub⁡(Ei), Q≥0∞ being the lexicographically ordered set of infinite sequences in Q≥0 with finitely many nonzero entries, such that for every i: (i) the centers Ci of the blow-ups are regular and are the locus where the pair (inv⁡,ρ) attains its maximum, in fact components of the maximal locus of inv⁡; (ii) the three invariants have finite ranges on each support; inv⁡ and the lexicographically ordered pairs (inv⁡,ν) and (inv⁡,ρ) are upper semicontinuous there; equivalently, the auxiliary functions ν and ρ are upper semicontinuous on every level stratum {inv⁡=a}; (iii) for x∈supp⁡(Ii+1,Ei+1,μ) with σi+1(x)∈Ci one has inv⁡(x)<inv⁡(σi+1(x)) or inv⁡(x)=inv⁡(σi+1(x)) and ν(x)<ν(σi+1(x)), while for σi+1(x)∉Ci one has inv⁡(x)=inv⁡(σi+1(x)), ν(x)=ν(σi+1(x)) and ρ(x)=ρ(σi+1(x)); (iv) for every etale morphism φ ⁣:X′→X the induced sequence φ∗(Xi) is an extension of the canonical resolution of φ∗(I,E,μ) and the invariants agree, inv⁡(φi(x′))=inv⁡(x′), ν(φi(x′))=ν(x′) and ρ(φi(x′))=ρ(x′). Order Sub⁡(Ei) by writing the labels of a subset in increasing order in the fixed total boundary order, padding with zeros, and comparing the resulting sequences lexicographically, with 0 below every divisor label. An empty subset is the all-zero sequence. This supplies the order used for relative upper semicontinuity of ρ and maxima of (inv⁡,ρ); it does not introduce a new choice of boundary order.

For an arbitrary étale morphism X′→X (Étale morphism of schemes), the pullback input may have a non-quasi-compact source. In condition (iv), the same notion is extended to these étale-local marked-ideal data: on every finite-type open chart of X′ use the preceding definition, and require a finite global sequence with a finite-range invariant family whose restrictions agree with those chart constructions up to inserted isomorphisms. The finite-type assumption remains on the original input X; no existence assertion is made for unrelated non-quasi-compact inputs. The canonical-resolution proposition proves this extension for arbitrary étale pullbacks, with sequence length bounded by that of the original resolution. Empty inverse centers contribute only inserted isomorphism steps, and invariant equalities refer to the corresponding stages.

The invariant inv⁡ takes values in the lexicographic order; the resolution is canonical in the sense that it is uniquely determined by the invariants, which are intrinsic.

Depends on

Used by

Dependency tree · two levels

32 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