Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Weighted coefficient bound for a product of power series

Proved
OAI.PiExponent.LiteralAnalytic.coeff_mul_norm_le_choose_weighted_succ_general

by Eyal1990 · Oct 16, 2026 · Mathlib 0df444a (Lean v4.33.1)

number-theoryopenai-pi-exponent-017

For nonnegative C and k ≥ 1, if the coefficients of f satisfy the degree-r binomial bound with scale C^k and the coefficients of g are bounded by C, then the degree-n coefficient of f*g satisfies the successor binomial bound.

Preamble
import Mathlib.Tactic
import Mathlib.RingTheory.PowerSeries.Order

open scoped BigOperators
Formal statement
theorem OAI.PiExponent.LiteralAnalytic.coeff_mul_norm_le_choose_weighted_succ_general
    (f g : PowerSeries ℂ) (k n : ℕ) (C : ℝ)
    (hC : 0 ≤ C)
    (hf : ∀ r, ‖PowerSeries.coeff r f‖ ≤
      C ^ k * (Nat.choose (r + k - 1) r : ℝ))
    (hg : ∀ r, ‖PowerSeries.coeff r g‖ ≤ C)
    (hk : 1 ≤ k) :
    ‖PowerSeries.coeff n (f * g)‖ ≤
      C ^ (k + 1) * (Nat.choose (n + (k + 1) - 1) n : ℝ) := by
  sorry
Source
https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/lean/OAI/NumberTheory/PiExponent/Analysis/LiteralAnalyticSummand.lean#L163-L175

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me