Proof of Summability of the Negative Powers of the Fourier Weights of the Torus
lemmalem:fourier-weights-summable-torus-2026aThe product bound comes from the coordinate bound for the Euclidean norm together with monotonicity of finite products and of powers. Summability is proved by bounding an arbitrary partial sum: the finitely many indices involved are carried by an injection into a cube of tuples, over which the majorant factorises by generalized distributivity into one-dimensional sums already bounded.
Each result cited is universally quantified over the data in its own statement, and is applied here to the data named. Natural numbers are read in through the canonical map, as fixed in The Real Numbers: Standing Notation and Background §numbers; they are positive there by claim 3 of Properties of the Canonical Map from the Natural Numbers to an Ordered Field, and by claim 6 of that lemma the canonical map is strictly increasing, so that an inequality between natural numbers holds in if and only if it holds in , the passage from back to using the trichotomy of claim 3 of Properties of the Order on the Natural Numbers. Write , a positive real number as recorded in the statement. We use that on is a total order, so reflexive and transitive, and that if and only if , by claim 3 of Elementary Arithmetic in an Ordered Field.
Claim 1 (The denominators). Let and . Then and by claim 2 of Nonnegativity of Squares in an Ordered Field, so and by claim 5 of Elementary Arithmetic in an Ordered Field, applied with the nonnegative multiplier , together with from claim 1 of Zero Products and Elementary Identities in a Field. Hence
and since by claim 6 of Elementary Order Arithmetic in an Ordered Field, the mixed transitivity of claim 2 of that lemma makes and positive; their inverses exist and are positive by claim 7 of that lemma. Moreover is positive: gives by claim 5 of Properties of Natural Number Powers in a Field, and by claim 4 of that lemma since ; so , and its inverse exists and is positive by claim 7 of Elementary Order Arithmetic in an Ordered Field.
Claim 2 (Clause 1). Let ; positivity was shown in claim 1. Let . By claim 4 of Elementary Properties of the Euclidean Norm on one has , and both sides are nonnegative by claim 1 of Properties of the Absolute Value in an Ordered Field and claim 1 of Elementary Properties of the Euclidean Norm on ; so claim 2 of Monotonicity of Squaring on the Nonnegative Elements of an Ordered Field gives , and by claim 1 of Nonnegativity of Squares in an Ordered Field. Multiplying by the nonnegative through claim 5 of Elementary Arithmetic in an Ordered Field and adding gives
All these numbers are nonnegative by claim 1, so claim 5 of Properties of Finite Products, applied to the two families and on , gives
the last equality being Natural Number Power of an Element of a Field. Since and , claim 2 of Real Powers Through the Exponential, and Elementary Asymptotic Tools: Monotonicity, Null Sequences of Negative Powers, Exponential Domination, Integer Rounding, and Square-Root and Exponential Inequalities gives , these real powers agreeing with the natural powers by claim 1 of that lemma. The left-hand product is positive: its factors are positive by claim 1, so the product is nonnegative by claim 5 of Properties of Finite Products and nonzero by claim 4 of that lemma. So by transitivity and claim 1 of Order Reversal under Reciprocals, and Summability of the Reciprocals of the Squares §reciprocal,
Finally, applying claim 2 of Properties of Finite Products to the families and , whose pointwise product is the constant family with by Natural Number Power of an Element of a Field and claim 2 of Properties of Natural Number Powers in a Field, shows that is the inverse of . This proves clause 1.
Claim 3 (A cube containing finitely many lattice points). Let be as in clause 2 and let . Then there is such that
Indeed, put for and . All the summands are nonnegative by claim 1 of Properties of the Absolute Value in an Ordered Field, hence so is each by claim 5 of Properties of Finite Sums; by claim 6 of that lemma and , so by transitivity, and by claim 5 again. By claim 4 of Real Powers Through the Exponential, and Elementary Asymptotic Tools: Monotonicity, Null Sequences of Negative Powers, Exponential Domination, Integer Rounding, and Square-Root and Exponential Inequalities the number is a natural number with . Hence by the mixed transitivity of claim 2 of Elementary Order Arithmetic in an Ordered Field, and claim 6 of Properties of the Absolute Value in an Ordered Field turns this into the two-sided bound asserted.
Claim 4 (Carrying the lattice points into a cube of tuples). Let , and be as in claim 3, let , and let be the set of -tuples in , which is nonempty and finite by claim 3 of Finiteness of Cartesian Products, Tuple Sets, and Permutation Sets. Put .
For and the real number is an integer, by claim 2 of Arithmetic, Order and Discreteness of the Integers together with from Lattice-Periodic Functions and the Periodic Function Classes §lattice and , from The Integers as a Subset of the Real Numbers. From we get . Being an integer that is at least , and so positive, is the image of a natural number: by The Integers as a Subset of the Real Numbers it is , or , or for some , and the first and third are excluded because is positive by claim 3 of Properties of the Canonical Map from the Natural Numbers to an Ordered Field and hence is negative by claim 4 of Elementary Order Arithmetic in an Ordered Field. That natural number lies in , since the inequality may be read in , as recorded at the start of this proof.
Let send to the map on whose value at is the natural number just described. It is injective: if then , hence , for every , so by claim 1 of Euclidean Points as Tuples of Real Numbers.
Claim 5 (Clause 2). Let be as in clause 2. By claim 1 the terms are positive, in particular nonnegative. Let , and let , , and be as in claims 3 and 4.
The map from to is a bijection: it is onto by the definition of , and the value at a point of is attained at only one because is injective. Hence is nonempty and finite, by claim 4 of Basic Properties of Finite Sets applied to , which has elements by claim 1 of that lemma. Writing for , claim 1 of Properties of a Sum over a Finite Index Set and then claim 2 of that lemma, applied to the bijection just described, give
Let be the map with
each factor being defined and positive as in claim 4 of Order Reversal under Reciprocals, and Summability of the Reciprocals of the Squares §shifted; hence by claim 5 of Properties of Finite Products. For and the -th component of satisfies , so , which dominates by clause 1. Therefore, by clause 1 of Nonnegativity and Monotonicity of a Sum over a Finite Index Set §comparison applied on the index set ,
Let , a nonempty set on which is a bijection from , by its injectivity. By claim 2 of Properties of a Sum over a Finite Index Set and then clause 3 of Nonnegativity and Monotonicity of a Sum over a Finite Index Set §monotone, applied to the nonnegative on and its nonempty subset ,
Let be the family on of families on with , independent of . Then for every , so Generalized Distributivity: Expanding a Product of Finite Sums gives
Each of these sums equals and is therefore at most by clause 4 of Order Reversal under Reciprocals, and Summability of the Reciprocals of the Squares §shifted; each is also nonnegative by claim 5 of Properties of Finite Sums, its summands being positive as recorded above. Hence claim 5 of Properties of Finite Products gives
by Natural Number Power of an Element of a Field. Since and is nonzero, field arithmetic gives .
Combining the displays, every partial sum satisfies
so the set of partial sums is bounded above by that number. By claim 1 of Series of Nonnegative Real Numbers, Comparison, and the Geometric Series the series converges with sum the least upper bound of the partial sums, and that least upper bound is at most , since the latter is an upper bound. This proves clause 2.
Loading…
Prerequisites
4a3bff96-9842-42b2-ada5-d40f0dfd2c02