Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedjudge pass (gpt-6.1-sol)audited 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.

Irreducible hypersurface germs and their components

Definition

Fix n≥1 and p∈Cn, and let X be a complex-analytic hypersurface germ at p, that is, a nonempty proper set germ of the form X=(Z(f),p) for a nonzero nonunit germ f (Complex-analytic hypersurface germ and its reduced equation).

A hypersurface subgerm of X is a hypersurface germ Y at p with Y⊆X as set germs; by the definition of a hypersurface germ, every such Y has the form (Z(g),p) for a nonzero nonunit g, and by Square-free reduction of a holomorphic equation and Reduced holomorphic germ for a hypersurface the equation may be taken reduced.

The germ X is reducible when there are hypersurface subgerms Y1,Y2⊆X with

Y1≠X,Y2≠X,X=Y1∪Y2

as set germs; it is irreducible when no such pair exists.

An irreducible component of X is an irreducible hypersurface subgerm Y⊆X that is maximal among the irreducible hypersurface subgerms of X: if Y⊆Y′⊆X and Y′ is an irreducible hypersurface subgerm, then Y′=Y.

Remarks

The notions only involve the set germ X: containment and union of set germs are defined by containment and union of representatives on a common neighbourhood of p, and the resulting notions do not depend on the chosen representatives or on the defining equation.

The pair condition in the definition of reducibility also covers finite decompositions. If X=Y1∪⋯∪Ys is a finite union of hypersurface subgerms with Yi=Z(gi), then the identity Z(g1)∪⋯∪Z(gs)=Z(g1⋯gs) writes the union as a single hypersurface subgerm, and grouping the factors into two products writes X as the union of the two corresponding subgerms Z(g1⋯gk) and Z(gk+1⋯gs). Thus X is reducible exactly when it is a finite union of hypersurface subgerms properly contained in it.

Depends on

Used by

Dependency tree · two levels

8 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