polynomial_bounded_on_interval
theoremverifiedformalizationimported Lean
For a polynomial P, show it's bounded on any bounded interval
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Real in open NNReal in open Field in open scoped ContDiff in lemma polynomial_bounded_on_interval (P : Polynomial ℝ) (a b : ℝ) : ∃ M : ℝ, ∀ x : ℝ, x ∈ Set.Icc a b → |P.eval x| ≤ M
- Formalizes
- Physlib, `polynomial_bounded_on_interval`
- Lean proof
- By Afiq Hatta, from github.com/leanprover-community/physlib at
e411c6e89692(Copyright (c) 2025 Afiq Hatta. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.34.1.polynomial_bounded_on_interval← polynomial_bounded_on_interval (Physlib/Mathematics/ForMathlib/Trigonometry/Tanh.lean:97): verbatim
- Verified
- 09 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Used by 1
- polynomial_tanh_boundedFor a polynomial P, show that P (tanh x) is bounded on the real line
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
set_option autoImplicit true inset_option relaxedAutoImplicit true inopen Real inopen NNReal inopen Field inopen scoped ContDiff in/-- For a polynomial P, show it's bounded on any bounded interval -/lemma polynomial_bounded_on_interval (P : Polynomial ℝ) (a b : ℝ) : ∃ M : ℝ, ∀ x : ℝ, x ∈ Set.Icc a b → |P.eval x| ≤ M := by -- Polynomials are continuous have hcont : Continuous (fun x => P.eval x) := P.continuous -- Closed bounded intervals are compact have hcompact : IsCompact (Set.Icc a b) := isCompact_Icc -- Continuous functions on compact sets are bounded obtain ⟨M, hM⟩ := hcompact.exists_bound_of_continuousOn hcont.continuousOn use M exact hM