Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6.1-sol)
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 of an ideal sheaf at a point

Definition

Let X be a locally Noetherian scheme, I⊆OX a coherent ideal sheaf (Coherent module sheaves, Ideal sheaves) and x∈X with maximal ideal mx⊂OX,x (A local ring is a nonzero commutative ring with a unique maximal ideal). The order of I at x is ord⁡x(I):=max⁡{ n≥0:Ix⊆mxn }, with ord⁡x(I):=+∞ when Ix=0; the maximum is attained for Ix≠0 because ⋂nmxn=0 in the Noetherian local ring OX,x (The Krull intersection is the (1−a)-torsion submodule, and it vanishes in the Jacobson-radical case). For f∈OX(U) put ord⁡x(f):=ord⁡x(fOU); a germ is of multiplicity one at x if ord⁡x(f)=1. If in addition OX,x is regular — the only case used on this page — then f is part of a regular system of parameters of OX,x, so the zero scheme V(f) is regular at x of dimension dim⁡OX,x−1 (regular local quotient by parameter is regular, under AC The Axiom of Choice). The parameter assertion follows by extending the nonzero class of f in the finite-dimensional cotangent space to a basis and applying the finite-generator Nakayama argument. If x∈V(I) and s=dim⁡OX,x, then ord⁡x(I)≥1; ord⁡x is the multiplicity used throughout this page, and it differs from the Hilbert-Samuel multiplicity, which is not used here.

Depends on

Used by

Dependency tree · two levels

33 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