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 holomorphic germs are prime
Statement
Let and let be an irreducible germ. Then is prime: for all germs ,
Here divisibility and primality are the divisibility relation and the irreducibility/prime conditions of Divisibility and associates in an integral domain and Irreducible and prime elements of an integral domain in the integral domain .
Facts & Assumptions
Given: An irreducible germ and germs with .
means for some ; associates are elements differing by a unit factor, and these notions are defined in any integral domain (Divisibility and associates in an integral domain). A nonzero nonunit is irreducible when every factorisation has a unit factor, and prime when implies or (Irreducible and prime elements of an integral domain).
is a unique factorisation domain (The ring of holomorphic germs is a UFD): it is an integral domain, every nonzero nonunit is a finite product of irreducibles, and whenever are products of irreducibles, then and, after a permutation, is associate to (Unique factorisation domain).
In a ring, units are invertible elements; a product of units is a unit, the inverse of a unit is a unit, and a product of a unit with a nonunit is a nonunit, since multiplying a purported inverse of the product by the unit inverse on the appropriate side would exhibit an inverse of the nonunit (Left inverse, right inverse, and invertible element of a monoid).
Proof technique: contradiction — factor all three germs and apply uniqueness of factorisation to locate the associate class of .
Proof
Assume , so that for some germ , and suppose for contradiction that and .
If , then gives ; similarly gives . Both contradict the supposition of step 1.1, so and , and then as well because is an integral domain by [F2].
If were a unit, then would give , and if were a unit then would give ; both contradict step 1.1. Hence and are nonunits.
The germ is a nonunit. If were a unit, then would be a factorisation of the irreducible germ into the nonunit and the nonunit — the latter because is a nonunit and is a unit, so [F3] applies — contradicting irreducibility of in [F1].
By [F2] factor the nonzero nonunits of steps 2.1, 2.2 and 3.1 into irreducibles, say , and with units and all displayed factors irreducible. Then and are equal, so the products of irreducibles and differ by the unit .
Setting , the germ is associate to , hence irreducible, and step 4.1 gives the equality of products of irreducibles
By the uniqueness clause of [F2] applied to the two products of step 5.1, the irreducible is associate to one of the irreducibles .
If is associate to some , then and because is one of the factors of , hence ; since is associate to , also , contradicting step 1.1. The same argument with some gives , again contradicting step 1.1. Hence the supposition of step 1.1 is impossible, so or ; this proves that the irreducible germ is prime.
Depends on
Used by
Dependency tree · two levels
18 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)
- Sharifi, Abstract Algebra, Advanced Ring Theory (unique factorisation domains) (standard reference, not scraped)