Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Decomposition of lost points by their first stopping time

Proved
BianchiIX.root_sdiff_survivingSet

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

bianchi-ix-era-statisticsdynamical-systems

For a sequence of sets KnK_nKn​ in a space XXX, define

K∞=⋂n≥0Kn,Fn=Kn∖Kn+1.K_\infty=\bigcap_{n\geq0}K_n,\qquad F_n=K_n\setminus K_{n+1}.K∞​=n≥0⋂​Kn​,Fn​=Kn​∖Kn+1​.

For real maps HiH_iHi​ and sets Ai⊂RA_i\subset\mathbb RAi​⊂R, put

S(H,A)=⋃iHi(Ai).\mathcal S(H,A)=\bigcup_i H_i(A_i).S(H,A)=i⋃​Hi​(Ai​).

If Kn+1⊂KnK_{n+1}\subset K_nKn+1​⊂Kn​ for every nnn, then

K0∖K∞=⋃n≥0Fn.K_0\setminus K_\infty=\bigcup_{n\geq0}F_n.K0​∖K∞​=n≥0⋃​Fn​.
Preamble
import Definitions.Def_BianchiIX_Statistics_StoppedMass
import Mathlib.Analysis.Calculus.Deriv.Inv
import Mathlib.Analysis.Calculus.Deriv.Add
import Mathlib.Analysis.SpecificLimits.Basic
import Mathlib.Data.List.Induction
import Mathlib.Tactic.FieldSimp
import Mathlib.Tactic.Linarith
import Mathlib.Tactic.Ring
import Mathlib.Data.PNat.Basic
import Mathlib.MeasureTheory.Constructions.BorelSpace.Metrizable
import Mathlib.Data.Rat.Floor
import Mathlib.NumberTheory.Real.Irrational
import Mathlib.Order.OrderIsoNat
import Mathlib.Analysis.SpecialFunctions.Log.Deriv
import Mathlib.MeasureTheory.Group.MeasurableEquiv
import Mathlib.MeasureTheory.Measure.Regular
import Mathlib.MeasureTheory.Function.JacobianOneDim

open BianchiIX
noncomputable section
open Set MeasureTheory
open scoped ENNReal

Formal statement
theorem BianchiIX.root_sdiff_survivingSet {X : Type*} (K : ℕ → Set X) (hK : Antitone K) :
    K 0 \ survivingSet K = ⋃ m, firstStoppedSet K m := by sorry
Source
https://github.com/l46430640-del/ERA-STATISTICS-FORMAL/blob/d74c241819f896ab8d050b21ace80c8e90eabd9e/BianchiIX/Statistics/StoppedMass.lean#L194-L211

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