Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

OAI.StandardMapEntropy.main_entropy_complete

Proved

by wurtle · Oct 7, 2026 · Mathlib 0df444a (Lean v4.33.1)

The theorem states that there is a threshold k₀>0 such that, for every real k≥k₀, three things hold for the standard map on the torus (ℝ/ℤ)², given by (x,y) ↦ (x+y+k sin(2πx), y+k sin(2πx)) with coordinates taken mod 1, and with area the product of Lebesgue measures on the two circles. First, the metric entropy of the standard map with respect to area is strictly positive, where this entropy (valued in [0,∞]) is the supremum over finite measurable partitions p of the infimum over n≥1 of the block entropy of the partition refined along the first n iterates, divided by n. Second, PositiveLargestLyapunov(k) holds: there is a measurable set E of positive area such that every point z in E has some l>0 for which the limit of (1/n) log of the operator norm of the n-step derivative product at z equals l, and LyapunovSpectrumAt(k,z,l) holds, meaning that either vectors all grow at exponential rate 0, or l>0 and there is a nonzero direction s such that every nonzero vector v has growth rate −l if s and v are parallel (wedge zero) and +l otherwise. The derivative product is built from a coordinate-conjugated 2×2 transfer matrix with potential 2+2πk cos(2πx). Third, the entropy is positive if and only if PositiveLargestLyapunov(k) holds; since both hold, this equivalence is true for large k.

Preamble
-- Generated from openai/math @ adc7f1241b42e322a6451854ab7e4b4c146bf78a
-- Source: lean/ComparatorChallenges/StandardMapLyapunov.lean; bytes 4245..4513
-- Kind: theorem; original declaration names and bodies preserved.
-- Source groups are independent. Target: Lean 4.33.1; see compilation.json.

import Mathlib
import Definitions.Def_StandardMapLyapunov

namespace OAI

open MeasureTheory Set Filter

open scoped ENNReal BigOperators Topology

namespace StandardMapEntropy

attribute [local instance] _root_.OAI.StandardMapEntropy.realTangentCompTriple

Formal statement
theorem main_entropy_complete :
    ∃ k₀ : ℝ, 0 < k₀ ∧ ∀ k : ℝ, k₀ ≤ k →
      0 < metricEntropy area (standardMap k) ∧
      PositiveLargestLyapunov k ∧
      (0 < metricEntropy area (standardMap k) ↔ PositiveLargestLyapunov k) := by
  sorry

end StandardMapEntropy
end OAI
Source
https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/lean/ComparatorChallenges/StandardMapLyapunov.lean
Human review
  • Endorsed by Community (Bot) · Oct 7, 2026

    Confirmed by the moderator at approval.

  • Endorsed by marwahaha · Oct 7, 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, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me