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.
Uniformly bounded separate rationality implies rationality
Statement
Let be a nonempty Zariski open subset and let be a meromorphic function on (locally a quotient of holomorphic functions). Suppose that there is such that on the affine coordinate lines outside a fixed proper algebraic exceptional set in each coordinate direction, whenever its meromorphic restriction is defined, restricts to a rational function of numerator and denominator degrees at most . Then is the restriction of an element of wherever the latter is defined.
Facts & Assumptions
Given: The data and hypotheses in the Statement.
A holomorphic function vanishing on a nonempty open subset of a domain vanishes identically: holomorphic functions on a connected domain agreeing on a nonempty open subset agree everywhere. A nonempty Zariski open subset of complex affine space is connected: a generic broken complex line connects any two points while avoiding the finitely many intersections with its algebraic complement.
Proof
Given: The stated data and Facts.
For the function is constant. For the hypothesis is the conclusion. For , put ; since polynomial degrees are integers, every degree bound in the hypothesis is then at most . Proceed by induction. Choose distinct constants in the first coordinate such that the slices are nonempty Zariski open and inherit the coordinate-line hypotheses in the remaining variables. Require also that none of the slices is identically a polar slice of , and that the generic first-coordinate restrictions are finite at all nodes. These additional choices are possible locally: represent near a point where and choose the nodes in that first-coordinate neighborhood; analytic uniqueness then prevents an entire chosen slice from being polar. Such constants exist: each exceptional algebraic set is defined by finitely many nonzero polynomials; a polynomial becomes identically zero after substituting for at most finitely many , unless it was zero to start with. For the direction , exclude also those where the line is exceptional or any node lies outside . The algebraic exclusions leave a nonempty Zariski open set, and the finitely many meromorphic pole exclusions still leave a nonempty analytic open subset.
Induction makes rational functions. Over , solve the homogeneous linear equations for the coefficients of two polynomials of degrees at most . There is a nonzero solution. It has , because otherwise has distinct roots and is zero, contradicting nonzeroness; this also covers .
For generic fixed , write the actual line restriction as with degrees at most and . The polynomial has degree at most and vanishes at every , hence is zero. Possible zeros of at nodes cause no problem for this cross-multiplied identity. Thus on a nonempty open set. Clear the rational coefficients to write this as equality of meromorphic functions on a nonempty open subset of , with polynomials . Let , and let be the set of points of near which is the zero meromorphic function. This set is open and nonempty. If , choose a connected ball around on which for holomorphic functions with not identically zero. The open set contains a point where , so vanishes on a nonempty open subset of . The holomorphic identity theorem [F1] gives on , whence meromorphically on and . Thus is also closed; connectedness from [F1] gives . This proves the meromorphic identity propagation needed here, and hence the induction and the assertion.
Depends on
Used by
Dependency tree · two levels
7 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
- Ginzburg, Guay, Opdam and Rouquier, On the category O for rational Cherednik algebras (standard reference, not scraped)