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.
Square-free reduction of a holomorphic equation
Statement
Let , let and let be a nonzero nonunit. Then admits a square-free reduction: there are pairwise nonassociate irreducible germs and a unit with
where is reduced in the sense of Reduced holomorphic germ for a hypersurface (no irreducible germ divides it twice). The associate class of depends only on : any other factorisation of into pairwise nonassociate irreducibles produces a product associate to . Moreover, on a neighbourhood of on which representatives of and are both defined, the two zero sets coincide:
Facts & Assumptions
Given: A nonzero nonunit germ .
A nonzero nonunit germ is reduced when no irreducible element divides it twice; the zero and unit germs are excluded from hypersurface equations (Reduced holomorphic germ for a hypersurface).
The holomorphic germ ring is a unique factorisation domain, hence an integral domain in which factorisations into irreducibles exist and are unique up to order and associates (The ring of holomorphic germs is a UFD, Unique factorisation domain).
A nonzero nonunit of a unique factorisation domain has a factorisation with a unit, the irreducible and pairwise nonassociate, and ; the multiset of associate classes of the and the exponents are determined by (Unique factorisation domain).
Proof technique: direct — choose the UFD factorisation, drop repeated factors, and compare zero sets.
Proof
By [F3] choose a factorisation with a unit, the pairwise nonassociate irreducible germs, and , and set .
The germ is a nonzero nonunit: it is a product of the nonunits in the domain of [F2], and a product of germs one of which is a nonunit cannot be a unit, while it is nonzero because a domain has no zero divisors and the .
The associate class of depends only on : if is another factorisation into pairwise nonassociate irreducibles, then by uniqueness in [F3] the multiset of associate classes with exponents equals ; hence the set of associate classes occurring, and therefore the product up to a unit, is the same for the two factorisations.
No irreducible germ divides twice. Let be irreducible with . Then , and factoring the quotient into irreducibles exhibits and as two irreducible factorisations of the same element; by uniqueness in [F3], is associate to one of the , say . But then , so writing as a product of irreducibles and comparing with shows that the associate class of occurs at least twice among the classes of , contradicting their pairwise nonassociateness. Hence is reduced by [F1].
For the zero sets, put and write the identities and in the germ ring; after shrinking to a neighbourhood on which representatives of and are both defined, the first identity gives , and the second gives , since a point with has and has no nilpotents. Therefore on that neighbourhood.
Steps 3.1, 2.2 and 4.1 establish all three asserted properties of the square-free reduction .
Depends on
Used by
- Complex-analytic hypersurface germ and its reduced equation Definition
- Irreducible hypersurface germs and their components Definition
- Regular and singular points of an analytic hypersurface Definition
- A nonreduced equation can hide a smooth hypersurface Example
- The coordinate axes form a reduced crossing Example
- The vanishing ideal of a reduced hypersurface germ is principal Lemma
- Finite unique irreducible components of a hypersurface germ Theorem
Dependency tree · two levels
15 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)