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 and a reduced nonzero nonunit germ . Center at and fix the data supplied by Finite local projection of a reduced hypersurface germ: an invertible complex-linear map , the affine coordinate map , a preparation
and its chosen product representative . Here is monic of degree in , with coefficients in , and is nonvanishing on the representative. Use the product neighbourhood of the finite-projection theorem, on which every slice has all its roots, counted with multiplicity, inside and none on ; mere agreement of zero sets on an arbitrary product does not suffice. Put and let , , be the restricted coordinate projection. This chosen projection is proper and surjective, and is a -sheeted holomorphic covering off the discriminant.
Discriminant. The discriminant of the fixed prepared equation is the base germ
the coefficient expression of The discriminant of a monic polynomial as the coefficient expression of applied to the monic polynomial over .
Branch set. The branch set of the projection is
the zero set of the discriminant germ inside the chosen base neighbourhood.
The definition is well posed for the fixed equation and projection:
- 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).
- The discriminant is not identically zero: as a germ (Reduced preparation has nonzero discriminant).
- For the value vanishes exactly when the slice has a repeated root (The discriminant is and vanishes exactly when a monic polynomial has a repeated root). Since is monic of degree , this happens exactly when the fibre is not a set of distinct simple roots, that is, exactly where the unramified local sheets supplied by the finite-projection theorem fail to exist. Thus 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 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 , whose chosen projection is branched at although the curve has no singular point; the singular locus itself is defined independently of any projection on this page.
Depends on
- The discriminant of a monic polynomial as the coefficient expression of $\Delta_n^2$
- Reduced preparation has nonzero discriminant
- The discriminant is $\prod_{i<j}(\alpha_i-\alpha_j)^2$ and vanishes exactly when a monic polynomial has a repeated root
- Uniqueness in Weierstrass preparation
- Weierstrass preparation theorem
- Finite local projection of a reduced hypersurface germ
Used by
- A branched projection of a smooth hypersurface Counterexample
- A regular hyperplane has a one-sheeted projection Example
- A reduced prepared hypersurface stays reduced nearby Lemma
- An irreducible plane curve gives a connected punctured covering Lemma
- The vanishing ideal of a reduced hypersurface germ is principal Lemma
- Convergent Puiseux parametrisation of an irreducible plane branch Theorem
- Singular locus of a reduced analytic hypersurface Theorem
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
- Jiří Lebl, Tasty Bits of Several Complex Variables, Chapter 6 §§6.1–6.7 (standard reference, not scraped)
- Jean-Pierre Demailly, Complex Analytic and Differential Geometry, Chapter II §§2, 4 and 6 (standard reference, not scraped)