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

Discriminant and branch set of a fixed Weierstrass projection

Definition

Fix n≥1 and a reduced nonzero nonunit germ f∈OCn,p. Center at p and fix the data supplied by Finite local projection of a reduced hypersurface germ: an invertible complex-linear map T, the affine coordinate map Φ(z)=p+Tz, a preparation

f∘Φ=u W(z′,t),

and its chosen product representative V×D. Here W is monic of degree d≥1 in t, with coefficients in On−1,0, and u is nonvanishing on the representative. Use the product neighbourhood of the finite-projection theorem, on which every slice has all its d roots, counted with multiplicity, inside D and none on ∂D; mere agreement of zero sets on an arbitrary product does not suffice. Put XW:=Z(W)∩(V×D) and let π:XW→V, (z′,t)↦z′, be the restricted coordinate projection. This chosen projection is proper and surjective, and is a d-sheeted holomorphic covering off the discriminant.

Discriminant. The discriminant of the fixed prepared equation is the base germ

DW(z′):=Disc⁡t(W)∈On−1,0,

the coefficient expression of The discriminant of a monic polynomial as the coefficient expression of Δn2 applied to the monic polynomial W(z′,⋅) over On−1,0.

Branch set. The branch set of the projection π is

Bπ:={z′∈V:DW(z′)=0},

the zero set of the discriminant germ inside the chosen base neighbourhood.

The definition is well posed for the fixed equation and projection:

  1. The Weierstrass polynomial is unique for that fixed linear projection, so it does not change if the original germ is multiplied by a unit, or if another preparation of the same regular germ is used (Uniqueness in Weierstrass preparation).
  2. The discriminant is not identically zero: DW≠0 as a germ (Reduced preparation has nonzero discriminant).
  3. For z0′∈V the value DW(z0′)=Disc⁡(W(z0′,⋅)) vanishes exactly when the slice has a repeated root (The discriminant is ∏i<j(αi−αj)2 and vanishes exactly when a monic polynomial has a repeated root). Since W is monic of degree d, this happens exactly when the fibre π−1(z0′) is not a set of d distinct simple roots, that is, exactly where the d unramified local sheets supplied by the finite-projection theorem fail to exist. Thus Bπ is the base locus of the branching of π.

The branch set belongs to the chosen projection: it is defined after fixing the linear coordinate change T and the base neighbourhood, and it need not equal the image under π of the singular locus of the hypersurface. The companion examples page exhibits the smooth curve y2=x, whose chosen projection (x,y)↦x is branched at x=0 although the curve has no singular point; the singular locus itself is defined independently of any projection on this page.

Depends on

Used by

Dependency tree · two levels

42 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