Kaluza's theorem on reciprocal power series
DefinitionPositive log-convex coefficients#✓fully proved
A real formal power series \(f = \sum_n a_n X^n\) has positive log-convex coefficients if \(a_n > 0\) for every natural number \(n\) and \(a_{n+1}^2 \le a_n a_{n+2}\) for every natural number \(n\). This is the hypothesis of Kaluza's bounds for the coefficients of the reciprocal series.
def HasPositiveLogConvexCoefficients (f : PowerSeries ℝ) : Prop :=
0 < PowerSeries.coeff 0 f ∧
∀ n : ℕ, 0 < PowerSeries.coeff (n + 1) f ∧
(PowerSeries.coeff (n + 1) f) ^ 2 ≤
PowerSeries.coeff n f * PowerSeries.coeff (n + 2) f
Sources
- László Tóth, Alternating Sums Concerning Multiplicative Arithmetic Functions, Journal of Integer Sequences 20, the lemma at lines 553–562 of https://cs.uwaterloo.ca/journals/JIS/VOL20/Toth/toth25.tex.
TheoremCoefficients of a positive log-convex series are positive#✓fully proved
If a real formal power series \(f\) has positive log-convex coefficients, then the coefficient of \(X^n\) in \(f\) is strictly positive for every natural number \(n\).
theorem HasPositiveLogConvexCoefficients.coeff_pos {f : PowerSeries ℝ}
(hf : HasPositiveLogConvexCoefficients f) (n : ℕ) : 0 < PowerSeries.coeff n f
def HasPositiveLogConvexCoefficients (f : PowerSeries ℝ) : Prop :=
0 < PowerSeries.coeff 0 f ∧
∀ n : ℕ, 0 < PowerSeries.coeff (n + 1) f ∧
(PowerSeries.coeff (n + 1) f) ^ 2 ≤
PowerSeries.coeff n f * PowerSeries.coeff (n + 2) f
MathlibExt/RingTheory/PowerSeries/KaluzaCoefficientBounds.lean:41
Uses 1 · Used by 1
TheoremLog-convexity of the coefficients#✓fully proved
If a real formal power series \(f = \sum_n a_n X^n\) has positive log-convex coefficients, then \(a_{n+1}^2 \le a_n a_{n+2}\) for every natural number \(n\).
theorem HasPositiveLogConvexCoefficients.sq_coeff_succ_le {f : PowerSeries ℝ}
(hf : HasPositiveLogConvexCoefficients f) (n : ℕ) :
(PowerSeries.coeff (n + 1) f) ^ 2 ≤ PowerSeries.coeff n f * PowerSeries.coeff (n + 2) f
def HasPositiveLogConvexCoefficients (f : PowerSeries ℝ) : Prop :=
0 < PowerSeries.coeff 0 f ∧
∀ n : ℕ, 0 < PowerSeries.coeff (n + 1) f ∧
(PowerSeries.coeff (n + 1) f) ^ 2 ≤
PowerSeries.coeff n f * PowerSeries.coeff (n + 2) f
MathlibExt/RingTheory/PowerSeries/KaluzaCoefficientBounds.lean:41
Uses 1 · Used by 1
TheoremKaluza's bounds for the coefficients of a reciprocal power series#✓fully proved
Let \(f = \sum_n a_n X^n\) be a real formal power series with positive log-convex coefficients, and let \(f^{-1} = \sum_n b_n X^n\) be its reciprocal in the ring of formal power series. Then \(b_0 = a_0^{-1}\), \(b_0 > 0\), and \(-a_n / a_0^2 \le b_n \le 0\) for every \(n \ge 1\).
The reciprocal is formal; no convergence is assumed.
theorem kaluza_coeff_inv_bounds (f : PowerSeries ℝ)
(hf : HasPositiveLogConvexCoefficients f) :
PowerSeries.coeff 0 (f⁻¹) = (PowerSeries.coeff 0 f)⁻¹ ∧
0 < PowerSeries.coeff 0 (f⁻¹) ∧
∀ n : ℕ, 1 ≤ n →
-(PowerSeries.coeff n f) / (PowerSeries.coeff 0 f) ^ 2 ≤
PowerSeries.coeff n (f⁻¹) ∧
PowerSeries.coeff n (f⁻¹) ≤ 0
def HasPositiveLogConvexCoefficients (f : PowerSeries ℝ) : Prop :=
0 < PowerSeries.coeff 0 f ∧
∀ n : ℕ, 0 < PowerSeries.coeff (n + 1) f ∧
(PowerSeries.coeff (n + 1) f) ^ 2 ≤
PowerSeries.coeff n f * PowerSeries.coeff (n + 2) f
MathlibExt/RingTheory/PowerSeries/KaluzaCoefficientBounds.lean:41
Sources
- László Tóth, Alternating Sums Concerning Multiplicative Arithmetic Functions, Journal of Integer Sequences 20, the lemma at lines 553–562 of https://cs.uwaterloo.ca/journals/JIS/VOL20/Toth/toth25.tex. Tóth attributes the nonpositivity of
bₙto T. Kaluza, Satz 3.
Uses 3
Loading dependency explorer…
The dependency explorer needs JavaScript and its graph data.