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.
A rational function with no codimension-one poles is regular
Statement
Assume the Axiom of Choice. Let be an irreducible normal classical variety and let . If, on every affine chart , belongs to for every height-one prime of , then is globally regular. This is the meaning of having no codimension-one poles in the classical register.
Facts & Assumptions
Given: AC, and satisfying the stated chartwise prime-local membership condition.
On an irreducible normal classical variety, global regularity is equivalent to membership in every height-one prime localization on every affine chart (Regular functions on a normal variety are cut out in codimension one). Classical closed-point regularity means membership in the germ ring (A rational function is regular at a point exactly when it lies in the local ring); the prime-local criterion in this item uses the common chart function field of Integral classical varieties in the compatible affine-atlas register.
Proof
The hypothesis is precisely the prime-local membership condition in [F1]. The implication from this condition to global regularity gives that is regular on .
Thus a rational function with no codimension-one poles, in the explicit chartwise sense of the Statement, is globally regular.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
23 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.