Polynomial translations and regular energies
Written by GPT-6.1 Sol (OpenAI) and GPT-6 Astra (OpenAI). Self-checked by the writing AI. Original exposition: CC0, excluding the separately licensed linked algebra readings.
Working question: How can one control patches whose centres run to infinity? For , translating the centre changes the linear and constant coefficients. Dividing by the full derivative strength makes those coefficients a bounded finite-dimensional family. For , translation in the second direction changes nothing. That invariant direction is part of the model and must remain in the normalization.
A compact Fourier patch sees only finitely many coefficients of a polynomial. To make estimates uniform over all such patches, translate the polynomial to the patch centre and divide by the size of all its derivatives there. The resulting polynomials form a compact family. A simple-characteristic condition ensures that each member either has a nonzero denominator or has a regular energy surface.
This lesson supplies that finite-dimensional argument for the global resolvent estimates. It uses elementary linear algebra and Taylor's formula for polynomials; the required scalar implicit-function argument is proved after Theorem 4.1. The proof of finiteness of critical values also uses the exact scalar Cauchy proof identified before Lemma 3.1 and two full algebraic prerequisites in the AI Integrated Stacks Project, the AI-integrated draft edition of the Stacks project. Their complete programme carriers prove Noetherian permanence and characteristic-zero separability, including the elementary ascending-chain, polynomial-division and root prerequisites. The analytical setting is developed in Division and radiation at regular energies. Yafaev [Y] and Teschl [T] provide freely accessible scattering background.
The polynomial properness and uniform-threshold constructions below are proved directly by finite-dimensional translation and degree induction. The free original comparison for properness is the properness argument in the proof of Hörmander [H55], Theorem 2.17; the proof below keeps an arbitrary parameter subspace and its exact invariant directions. The critical-value proof uses the exact freely accessible AI Integrated Stacks Project revision specified in its proof and references. In particular, it covers every real polynomial and retains the original ambient strengths when invariant directions are present. The local graph construction after Theorem 4.1 supplies the scalar implicit-function argument used to interpret its regular alternative.
1. Measuring every polynomial derivative
Let be a nonzero polynomial of degree on , possibly with complex coefficients. Define its derivative strength by
A nonzero derivative of order is constant, so has a positive lower bound. Taylor's formula gives
Thus is a norm of the coefficient vector of the translated polynomial. All norms on this fixed finite-dimensional coefficient space are equivalent. In particular, for every , the polynomials
have uniformly bounded derivatives of every order on . Their coefficient vectors have compact closure.
Here the polynomial Taylor identity follows by expanding each monomial with the finite binomial formula. If , the coefficient norm just used is . For it is exactly one, so no polynomial in its coefficient closure is zero. Each derivative on a fixed ball is a finite sum of bounded monomials times those coefficients, giving the asserted uniform bounds at every fixed order. The finite-dimensional norm and compactness proof supplies norm equivalence and compact coefficient closure, also for complex coefficients considered as real coordinate pairs.
A nonzero polynomial with complex coefficients cannot vanish at every real point. In one variable, division by at a root and degree induction bound the number of distinct roots by the degree; the required division proof works over . For several variables, hold all but the last variable fixed at real values. Vanishing on the real line makes every coefficient polynomial vanish on all real choices of the remaining variables; induction proves all coefficients zero. This justifies choosing a real direction where a nonzero highest homogeneous part does not vanish.
The invariant-direction space is
Here , with no factor of . Polynomial Taylor expansion shows that this is exactly the set of such that for every real .
Theorem 1.1. For any linear subspace and , the set
is bounded modulo : its orthogonal projection on the complement of that invariant space in is bounded. Consequently, if , then as .
Proof. We prove the bounded-projection assertion by induction on degree. It is immediate for a constant polynomial, whose invariant space is all of .
Write , where is the highest homogeneous part and . The homogeneous part of degree of is
Bounded translated coefficients therefore bound in coefficient norm. The linear map on has kernel . On the orthogonal complement of it is injective and bounded below: its norm has a positive minimum on the compact unit sphere. Decompose , where belongs to that complement and . It follows that is bounded.
Translation by a bounded vector, or its negative, is uniformly bounded on the coefficient space: its matrix entries are fixed polynomials in that vector. Applying translation by to shows that has bounded coefficients. Since leaves invariant,
Hence has bounded coefficients. If , set ; its coefficients impose no additional restriction, and the bound modulo is already established. Otherwise apply the induction hypothesis to with parameter space . It bounds modulo . Homogeneous degrees cannot cancel in , so
Combining the bounded and the induction bound proves the assertion. For , each strength sublevel is closed and bounded, hence compact. A sequence escaping every bounded set cannot stay in any such sublevel; this proves the last statement.
Example 1.2. Take and a centre . Then
The value of alone stays zero on the unbounded parabola . The coefficient of detects escape along that parabola. Bounded derivative strength first bounds , and then the constant coefficient bounds .

Figure 1. The shaded set is , equivalently , with boundary , . It lies in the proved enclosure . The point still has , but its strength is . Curves are sampled from these exact formulas. The figure illustrates Theorem 1.1 and this example. The full-size vector figure and its Python plotting source accompany the editable package.
2. Weaker polynomials and simple characteristics
For another polynomial , write
We call weaker than when this number is finite. The derivatives of the zero polynomial have strength zero. Every derivative is weaker than , with ratio at most one, since its strength sum is a sub-sum of the strength sum for .
If is weaker, then . Indeed choose a direction on which its highest homogeneous part does not vanish. Along that ray, its value grows like the corresponding degree, whereas . A higher degree would contradict the bounded ratio. Taylor expansion therefore gives, for every fixed ,
Terms with derivative order above the degree are zero. The constant is independent of the coefficients of .
Now assume that is real. We call it simply characteristic if
Replacing the Euclidean gradient norm by the sum of its component absolute values changes only the constant. This condition controls higher derivatives by the value and first derivatives. It does not require ellipticity.
Example 2.1. The nonelliptic quadratic has
It is simply characteristic and has no invariant direction. The operator with symbol is weaker, while the operator with symbol is not: on , the latter strength grows quadratically and grows only linearly. Order alone is therefore insufficient to decide weakness.
Lemma 2.2 (retain the ambient strength on the quotient). Put , , and let be orthogonal projection onto . Then
Every weaker has , with the same identities for its ambient derivatives and strength. No change of coordinate norm or of is involved.
Proof. Integrating along every line gives translation invariance for each . Differentiate that identity in the original ambient coordinates; projection subtracts an element of , proving all three assertions. For fixed ,
The polynomial in on the left is bounded. A nonconstant polynomial is unbounded along the real line, by its leading term, so this one is constant. Differentiating at zero gives ; its differentiated translation identity proves the rest.
3. Why only finitely many critical energies occur
Define
Lemma 3.1. For any real polynomial , the set is finite.
The algebraic-closure fact used in the proof has the following exact programme input. The scalar Cauchy lesson, Theorems 3.2–3.3 and Exercise 1 with its solution proves Cauchy's coefficient estimates, Liouville and the fundamental theorem of algebra. Explicitly, if a nonconstant complex polynomial had no root, its reciprocal would be entire and bounded: its leading term forces the reciprocal to tend to zero at infinity, and continuity bounds it on the remaining compact disc. Liouville makes that reciprocal constant, a contradiction. Dividing by each root and inducting on degree factors every polynomial into linear factors. In particular, an element algebraic over has a linear minimal polynomial and belongs to . The cited programme proof is read before this lemma.
Proof. Extend to a polynomial over . Its complex critical set is cut out by its first derivatives. We use the Noetherian polynomial-ring theorem, with its complete proof in the programme’s AI Integrated Stacks Project algebra carrier. The carrier includes the source's two-index ascending-chain argument and its elementary completion. It implies that descending chains of algebraic closed sets stabilize: their ideals of vanishing polynomials form an ascending chain, and a closed set is recovered as the common zero set of its vanishing ideal.
For clarity, write . Arbitrary intersections of such sets are obtained by taking unions of the defining families, and : a point outside the union has one nonzero value from each family, hence a nonzero product. These are the closed sets being used. If , then gives , and the opposite inclusion follows directly from the definition of . Thus recovery from the vanishing ideal uses no Nullstellensatz.
Consequently is a finite union of irreducible closed sets. To justify this implication, a minimal closed set failing to be a finite union would, if reducible, be the union of two proper closed sets. Each of those satisfies the finite-union property by minimality, a contradiction. A minimal counterexample exists if any exists, by the descending-chain condition.
For each nonempty irreducible component , its vanishing ideal is prime. If a product vanishes, irreducibility applied to its two zero sets says one factor vanishes everywhere on . Thus
is a domain, with a finitely generated fraction field . Denote the image of by . We prove .
Since , the constant polynomial does not vanish on ; thus is proper. The quotient and fraction-field construction makes a nonzero domain and embeds it in . Every element of is a polynomial in the images of the , and every element of is a ratio of two such polynomials. Hence these finitely many images generate as a field over .
Suppose that . Algebraic closure of makes transcendental. Include it in a transcendence basis of . Such a finite basis is obtained by adding generators that remain algebraically independent; the remaining generators are algebraic. The complete finite-extension proof justifies this with prescribed as the first independent element: rejected generators satisfy nonzero polynomial relations over the current independent list, and finite algebraic towers have finite dimension. Thus the field over which is finite is
On , the usual derivative with respect to is a -linear derivation with . It extends across each algebraic generator.
Both assertions are proved in the derivation construction. Algebraic independence identifies the polynomial algebra in the basis with a genuine polynomial ring; formal differentiation is therefore unambiguous. The quotient rule extends it to its fraction field, with well-definedness checked from cross multiplication. The construction over a simple algebraic extension uses the minimal polynomial and the fact, proved there by division and Bézout, that . If has minimal polynomial , the extension is forced, and defined, by
The denominator is nonzero by the complete programme proof of Irreducible polynomials and characteristic-zero separability. Its AI Integrated Stacks Project proof separates a zero derivative before the degree argument, and its explicit Bézout consequence proves . To check that this actually defines a derivation, extend to the polynomial ring in a formal variable , with values in , by evaluating coefficients at and assigning the displayed value. The product rule makes the image of zero. The derivative of every multiple of is therefore zero after evaluation. Thus this map descends to ; the quotient rule extends any intermediate integral domain to its fraction field. Iterating across the finitely many algebraic generators extends to .
But in , every first derivative of is zero, by the definition of . The polynomial chain rule in therefore gives
contradicting . Thus is a complex constant on each of the finitely many components. Its real critical values belong to this finite set. If the critical set is empty, the conclusion is immediate.
This algebraic proof is separate from the uniform estimate below; that estimate only needs the compact energy set to avoid .
4. A uniform alternative near every frequency centre
Theorem 4.1. Let be a nonzero real simply characteristic polynomial, allowing invariant directions. If is a nonempty compact set containing no point of , there is an such that
There is also an , independent of , for which every normalized denominator
has one of the following properties on :
- Its absolute value is at least .
- The real polynomial has a unit direction with .
All derivatives on that ball have uniform bounds. The coefficient and imaginary-parameter pairs have compact closure.
Proof. Set , , and as in Lemma 2.2. The ratio in the theorem equals its value at : its denominator and all ambient first derivatives are invariant. Put . Apply Theorem 1.1 with parameter space ; since , its closed strength sublevels in are compact. Thus for large, . The simple-characteristic inequality then gives
The first contribution is less than , so the desired ratio is at least . On the remaining compact product of a closed ball in with , the ratio is continuous and positive: a zero would mean and , which was excluded. Its positive minimum proves the first assertion on all of the original ambient space. If , only this compact case is needed; it includes nonzero constant polynomials with separated from their constant value.
The normalized Taylor coefficients are bounded, including the subtracted real part of , because has a positive lower bound. Thus the polynomials, their gradients and Hessians have uniform bounds on the unit ball, and is bounded. At zero, either the denominator has absolute value at least , or the real gradient has norm at least .
In the first case choose a ball small enough that the uniformly bounded gradient changes the denominator by at most . In the second case put and choose a ball small enough that the Hessian bound changes this directional derivative by at most . Taking , where bound the gradient and Hessian operator norms on the unit ball, proves the alternative. Finite-dimensional boundedness gives compact closure of the coefficient and parameter pairs; the positive inequalities survive passage to that closure.
For the directional alternative, also take a convergent subsequence of the unit directions, whose sphere is compact. Coefficient convergence gives uniform convergence of the gradients on the fixed ball, so the limiting direction retains the lower bound . In the nonvanishing alternative, uniform convergence of the denominators preserves its lower bound. Every convergent sequence has a subsequence in at least one of these two cases, so the same alternative holds throughout the compact closure.
Local graph construction. In the regular alternative, rotate the increasing direction to the first coordinate and write the smooth real function as . Near any point of a level , take a closed rectangle on which . On each fixed fibre, the mean value theorem makes strictly increasing. First choose two nearby endpoints on either side of the point; their values bracket strictly. By continuity the same bracketing holds for all in a smaller product neighborhood. The intermediate value theorem and strict monotonicity give a unique solution .
The lower derivative bound and a uniform bound for give Indeed compare the two values of first in the direction at fixed , then in the direction at fixed . Thus is continuous. Subtracting the two equations , dividing by a parameter increment and using the integral mean value formula proves with the derivatives of evaluated at . For a general simultaneous increment, the differentiability remainder for divided by the increment tends to zero because the displayed Lipschitz bound controls the change of ; hence these partial formulas give its total derivative. Their right sides are continuous. Differentiating them repeatedly proves smoothness by induction, with bounds through any fixed order depending only on and the corresponding bounded derivatives of on a smaller rectangle. This proves the local graph statement and its uniform finite-order control directly.
One may also choose its product neighborhood uniformly for points in the ball of radius from Theorem 4.1. In the increasing coordinates, put , let bound the transverse gradient, and choose . At a level point , the two endpoints , for fixed , have values at least on opposite sides of the central level. If
the transverse change is at most , so both endpoints still bracket with margin at least . The product remains in the radius- ball, since its distance from the level point is at most . The preceding argument then gives a common inverse neighborhood, with derivative bounds independent of the translating centre. Rotations preserve the gradient and Hessian bounds, and higher rotated derivatives are bounded finite combinations of the original derivatives.
For real , the second case is therefore a uniformly regular local energy surface wherever that level meets the patch. For a genuinely nonreal , its real part is allowed to be a critical value: it is the complex point itself that must avoid the real critical set. The nonzero imaginary part can supply the nonvanishing-denominator case.
Example 4.2 (an unbounded invariant direction). For , , and at
The second coordinate is unrestricted. The full strength need not tend to infinity in that direction; its properness on is exactly what the proof uses. The normalized denominators, their full-dimensional cutoffs, and every original ambient derivative remain unchanged.

Figure 2. For , the exact sublevel is the infinite strip . Its orthogonal projection onto is . Arrows indicate the invariant direction beyond the displayed window. The threshold ratio is constant along each such line and at least one at zero energy. Theorem 1.1, Lemma 2.2 and Theorem 4.1 explain the projection and the unchanged ambient estimate. Vector figure; plotting source accompanies the editable package.
Use the conclusion
Work the two polynomial examples with the ambient strength before taking its quotient. Distinguish a critical energy from an unbounded regular shell; only the first is a threshold obstruction.
5. Exercises
Exercise 5.1 (foundation). For , compute and . Explain precisely why properness holds on the quotient by invariant directions but fails on all of .
Exercise 5.2 (foundation). For Example 1.2, derive the exact boundary of and prove its enclosure . Compute the strength at .
Exercise 5.3 (intermediate). For , prove that is weaker with ratio at most , while is not weaker. Explain why a second-order multiplier cannot be included merely because has order two.
Exercise 5.4 (intermediate). Check that has no invariant direction but fails the simple-characteristic inequality. Identify a sequence witnessing the failure. Does this example contradict Theorem 1.1?
Exercise 5.5 (advanced). For , show and . Evaluate the ratio in Theorem 4.1 at , and explain why no positive uniform can persist as .
6. Complete solutions
Solution 5.1. The strength is , and , so the invariant space is . A strength sublevel bounds and leaves unrestricted. Its projection to the quotient, identified with the axis, is bounded. The sequence shows why the full-space claim would be false without the invariant-direction condition.
Solution 5.2. The inequality is . It first gives , then
The lower endpoint is at least . For the upper endpoint set ; it is . Thus the stated rectangle contains the set. At , the value term vanishes but the squared strength is .
Solution 5.3. For , . Since
the ratio is at most . For , its squared strength is . On , the ratio is
The uncontrolled growth occurs along the zero-energy cone; comparing degrees misses it.
Solution 5.4. The directional derivative is , identically zero only for . On , both and its gradient are zero, while . Thus , whereas the proposed right side is the fixed constant . Theorem 1.1 says strength tends to infinity without invariant directions, exactly as it does here; it does not assert the simple-characteristic bound.
Solution 5.5. The squared strength is ; its positive square root is . The sole critical point is zero and its value is zero. At the prescribed centre, the value difference is zero, so the ratio is . Each fixed compact set away from zero has its own positive bound. Extending that bound across a threshold would require a different estimate.
References
- [Y] Dmitri Yafaev, Lectures on scattering theory, 2004, arXiv:math/0403213.
- [T] Gerald Teschl, Mathematical Methods in Quantum Mechanics: With Applications to Schrödinger Operators, second edition, 2014. Free author edition. This is the freely accessible edition actually checked for the repair.
- [H55] Lars Hörmander, “On the theory of general partial differential operators,” Acta Mathematica 94 (1955), 161–248. The properness argument inside the proof of Theorem 2.17 establishes derivative-strength properness from homogeneous parts and their invariant directions. Original article.
- AI Integrated Stacks Project, the AI-integrated draft edition of the Stacks project: Noetherian polynomial rings and localization and Irreducible polynomials and their derivatives. The complete programme algebra carriers and component notice preserve this exact revision, its source excerpts and the elementary completions used above. Their baseline text retains the GNU Free Documentation License. The Stacks project’s Noetherian-ring lemma and irreducible-polynomial lemma remain upstream comparisons. No baseline expression is incorporated into this lesson or included in its CC0 dedication.