Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Compact phase composition preserves the weak-wall factor

Proved
BianchiIX.compact_phase_composition_bounds

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

bianchi-ix-era-statisticsdynamical-systems

Let A,B,x,y≥0A,B,x,y\geq0A,B,x,y≥0 with x+y≤1x+y\leq1x+y≤1. Let p,q,r∈R3p,q,r\in\mathbb R^3p,q,r∈R3 have all components bounded in absolute value by AAA, and suppose

∣Bu∣,∣Bv∣≤A,∣E∣,∣Lr∣≤BA2y(x+y),∣Lu∣≤BAy,∣Lv∣≤BA(x+y).|B_u|,|B_v|\leq A,\quad |E|,|L_r|\leq BA^2y(x+y),\quad |L_u|\leq BAy,\quad |L_v|\leq BA(x+y).∣Bu​∣,∣Bv​∣≤A,∣E∣,∣Lr​∣≤BA2y(x+y),∣Lu​∣≤BAy,∣Lv​∣≤BA(x+y).

Put Dj=Lrpj+Luxqj+LvyrjD_j=L_rp_j+L_u xq_j+L_v yr_jDj​=Lr​pj​+Lu​xqj​+Lv​yrj​ and C=BA2(A+3)C=BA^2(A+3)C=BA2(A+3). Then

∣E∣+∣D0∣≤Cy(x+y),∣D1+LuBu∣≤Cy,∣D2+LvBv∣≤C(x+y).|E|+|D_0|\leq Cy(x+y),\quad |D_1+L_uB_u|\leq Cy,\quad |D_2+L_vB_v|\leq C(x+y).∣E∣+∣D0​∣≤Cy(x+y),∣D1​+Lu​Bu​∣≤Cy,∣D2​+Lv​Bv​∣≤C(x+y).
Preamble
import Mathlib.Data.Real.Basic
import Mathlib.Tactic.Linarith
import Mathlib.Tactic.Positivity
import Mathlib.Tactic.Ring

namespace BianchiIX
end BianchiIX

open BianchiIX

Formal statement
theorem BianchiIX.compact_phase_composition_bounds {A B x y E Lr Lu Lv Bu Bv : ℝ}
    (p q r : Fin 3 → ℝ) (hA : 0 ≤ A) (hB : 0 ≤ B)
    (hx : 0 ≤ x) (hy : 0 ≤ y) (hb : x + y ≤ 1)
    (hp : ∀ j, |p j| ≤ A) (hq : ∀ j, |q j| ≤ A) (hr : ∀ j, |r j| ≤ A)
    (hBu : |Bu| ≤ A) (hBv : |Bv| ≤ A)
    (hE : |E| ≤ B * A ^ 2 * y * (x + y))
    (hLr : |Lr| ≤ B * A ^ 2 * y * (x + y))
    (hLu : |Lu| ≤ B * A * y) (hLv : |Lv| ≤ B * A * (x + y)) :
    let D := fun j => Lr * p j + Lu * (x * q j) + Lv * (y * r j)
    let C := B * A ^ 2 * (A + 3)
    |E| + |D 0| ≤ C * y * (x + y) ∧
      |D 1 + Lu * Bu| ≤ C * y ∧ |D 2 + Lv * Bv| ≤ C * (x + y) := by sorry
Source
https://github.com/l46430640-del/ERA-STATISTICS-FORMAL/blob/d74c241819f896ab8d050b21ace80c8e90eabd9e/BianchiIX/Analysis/CompactPhaseComposition.lean#L8-L77

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