Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

The increasing interval inverse agrees with ordinary local inverses

Proved
BianchiIX.intervalRadiusInverse_positive_control

by trppppp · Nov 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

bianchi-ix-era-statisticsdynamical-systems

Let a<ba<ba<b, and let fff be C1C^1C1 at every point of [a,b][a,b][a,b] with f′>0f'>0f′>0 there. Put g=invFunOn⁡f [a,b]g=\operatorname{invFunOn}f\,[a,b]g=invFunOnf[a,b]. Then fff is strictly increasing on [a,b][a,b][a,b], its image is [f(a),f(b)][f(a),f(b)][f(a),f(b)], and ggg is a two-sided inverse between these intervals. For every y∈(f(a),f(b))y\in(f(a),f(b))y∈(f(a),f(b)), one has g(y)∈(a,b)g(y)\in(a,b)g(y)∈(a,b), ggg is C1C^1C1 at yyy, and g′(y)=1/f′(g(y))g'(y)=1/f'(g(y))g′(y)=1/f′(g(y)).

Preamble
import Definitions.Def_BianchiIX_EraReturnData
import Mathlib.Analysis.Calculus.InverseFunctionTheorem.ContDiff
import Mathlib.Analysis.Calculus.InverseFunctionTheorem.Deriv
import Mathlib.Tactic.NormNum
import Mathlib.Analysis.Calculus.Deriv.MeanValue
import Mathlib.Analysis.Calculus.ContDiff.Deriv

noncomputable section
open BianchiIX
open Set Filter
open scoped Topology

Formal statement
theorem BianchiIX.intervalRadiusInverse_positive_control {f : ℝ → ℝ} {a b : ℝ} (hab : a < b)
    (hf : ∀ x ∈ Icc a b, ContDiffAt ℝ 1 f x)
    (hd : ∀ x ∈ Icc a b, 0 < deriv f x) :
    let g := intervalRadiusInverse f a b
    StrictMonoOn f (Icc a b) ∧ f '' Icc a b = Icc (f a) (f b) ∧
      LeftInvOn g f (Icc a b) ∧ MapsTo g (Icc (f a) (f b)) (Icc a b) ∧
      RightInvOn g f (Icc (f a) (f b)) ∧
      ∀ y ∈ Ioo (f a) (f b), g y ∈ Ioo a b ∧ ContDiffAt ℝ 1 g y ∧
        HasDerivAt g (deriv f (g y))⁻¹ y := by sorry
Source
https://github.com/l46430640-del/ERA-STATISTICS-FORMAL/blob/d74c241819f896ab8d050b21ace80c8e90eabd9e/BianchiIX/Analysis/PositiveIntervalInverse.lean#L10-L58

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me