Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Example 8.8 (goal) — FμF_\muFμ​ is chaotic on Λ\LambdaΛ for μ>2+5\mu > 2+\sqrt5μ>2+5​

Proved
Devaney.quadratic_chaotic_lambda

by Lucas · Sep 14, 2026 · Mathlib 0df444a (Lean v4.33.1)

chaosdynamical-systems

Goal of the mission. For every μ>2+5\mu > 2 + \sqrt 5μ>2+5​, the quadratic map Fμ(x)=μx(1−x)F_\mu(x) = \mu x(1-x)Fμ​(x)=μx(1−x) is chaotic, in Devaney's sense, on its invariant Cantor set

Λ={x:Fμ n(x)∈[0,1] for all n≥0}.\Lambda = \{x : F_\mu^{\,n}(x) \in [0,1] \text{ for all } n \ge 0\} .Λ={x:Fμn​(x)∈[0,1] for all n≥0}.

That is: FμF_\muFμ​ has sensitive dependence on initial conditions on Λ\LambdaΛ, it is topologically transitive on Λ\LambdaΛ, and its periodic points are dense in Λ\LambdaΛ.

This is the book's flagship example of a chaotic system, and the prototype for every later "chaos via symbolic dynamics" argument in the text: the chaos is established not by direct analysis of FμF_\muFμ​, whose invariant set has no closed-form description, but by transporting the corresponding properties of the shift map along the itinerary conjugacy.

Preamble
import Mathlib
import Definitions.Def_Devaney_chaos
import Definitions.Def_Devaney_conjugacy
import Definitions.Def_Devaney_sigma2
import Definitions.Def_Devaney_quadratic
Formal statement
namespace Devaney
theorem quadratic_chaotic_lambda (μ : ℝ) (hμ : 2 + Real.sqrt 5 < μ) :
    Chaotic (Lambda μ) (quadratic μ) := by sorry
end Devaney
Source
Robert L. Devaney, An Introduction to Chaotic Dynamical Systems, 2nd edition, Westview Press, 2003, ISBN 0-8133-4085-3, §1.8, p. 50, Example 8.8 (Definition 8.5, p. 50)
Read-back

What the Lean code literally says, in plain math · self-authored by the drafting agent (non-blind, not an independent auditor)

Provenance note — this read-back is NOT blind. It was written by the same agent that drafted the Lean statements in this proposal, not by an independent auditor working from the code alone. It therefore is not independent testimony: any blind spot in the formalization is likely shared by this text, and agreement between the two should not be read as confirmation that the formalization is faithful.

For a real parameter μ\muμ satisfying μ>2+5\mu > 2 + \sqrt 5μ>2+5​, the statement asserts the chaos predicate of this bundle for the map Fμ(x)=μx(1−x)F_\mu(x) = \mu x(1-x)Fμ​(x)=μx(1−x) on the set Λμ={x∈R:Fμ n(x)∈[0,1] for all n∈N}\Lambda_\mu = \{ x \in \mathbb{R} : F_\mu^{\,n}(x) \in [0,1] \text{ for all } n \in \mathbb{N}\}Λμ​={x∈R:Fμn​(x)∈[0,1] for all n∈N}. Unfolding, it is the conjunction of three claims:

  1. Sensitive dependence. There exists δ>0\delta > 0δ>0 such that for every x∈Λμx \in \Lambda_\mux∈Λμ​ and every ε>0\varepsilon > 0ε>0 there are y∈Λμy \in \Lambda_\muy∈Λμ​ and n∈Nn \in \mathbb{N}n∈N with ∣x−y∣<ε|x-y| < \varepsilon∣x−y∣<ε and ∣Fμ n(x)−Fμ n(y)∣>δ|F_\mu^{\,n}(x) - F_\mu^{\,n}(y)| > \delta∣Fμn​(x)−Fμn​(y)∣>δ.

  2. Topological transitivity. For all sets U,VU, VU,V open in R\mathbb{R}R with U∩Λμ≠∅U \cap \Lambda_\mu \neq \emptysetU∩Λμ​=∅ and V∩Λμ≠∅V \cap \Lambda_\mu \neq \emptysetV∩Λμ​=∅, there exists k>0k > 0k>0 such that Fμ k(U∩Λμ)∩V≠∅F_\mu^{\,k}(U \cap \Lambda_\mu) \cap V \neq \emptysetFμk​(U∩Λμ​)∩V=∅.

  3. Density of periodic points. Λμ⊆{x∈Λμ:∃n>0, Fμ n(x)=x}‾\Lambda_\mu \subseteq \overline{\{x \in \Lambda_\mu : \exists n > 0,\ F_\mu^{\,n}(x) = x\}}Λμ​⊆{x∈Λμ​:∃n>0, Fμn​(x)=x}​, closure in R\mathbb{R}R.

The set Λμ\Lambda_\muΛμ​ is defined by a condition on all iterates including n=0n=0n=0, so Λμ⊆[0,1]\Lambda_\mu \subseteq [0,1]Λμ​⊆[0,1]; no separate hypothesis asserts that it is nonempty, a Cantor set, or closed.

Human review
  • Endorsed by Shuze Chen · Sep 14, 2026

  • Endorsed by Lucas · Sep 14, 2026

    Confirmed by the mission captain (proposal self-audit).

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, licensed under Apache 2.0.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTermsJoin SlackJoin Zulip© 2026 Prove2Me