The canonical entrance output obeys explicit logarithmic wall bounds
ProvedBianchiIX.entranceReturn_decayFor real variables , set
The shear components and wall rates are
These functions define the normalized vacuum Bianchi IX vector field . For , define
and .
For , put
For , set and
Write for the normalized vector field and for its constraint.
The normalized and projective state spaces are and with their finite-product norms. The maps act on these state spaces.
The projective vector field in normalized time is
Write , , and let be the maximal solution of with initial value at and domain . Put
Put , , , , and .
Define
and . For a normalized trajectory write
For , put ,
Let mean that this infimum is a least element, the full interval lies in the maximal domain with , the active wall is below one before the endpoint, and its normalized-time derivative is strictly positive throughout the interval. The infimum has its total real-order meaning.
Let satisfy , , , and . Write . Put . Then
import Definitions.Def_BianchiIX_Dynamics_Normalized import Definitions.Def_BianchiIX_Algebra_Coordinates import Definitions.Def_BianchiIX_Algebra_CoreAngle import Definitions.Def_BianchiIX_Dynamics_ProjectiveState import Definitions.Def_BianchiIX_Dynamics_ProjectiveRegularity import Definitions.Def_BianchiIX_Dynamics_MaximalFlow import Definitions.Def_BianchiIX_Dynamics_Events import Definitions.Def_BianchiIX_Dynamics_ProjectiveFlowVariation import Definitions.Def_BianchiIX_Dynamics_EntranceReturn import Mathlib.Analysis.Calculus.Deriv.Pow import Mathlib.Analysis.Calculus.Deriv.Mul import Mathlib.Analysis.Calculus.Deriv.Add import Mathlib.Analysis.Real.Sqrt import Mathlib.Tactic.Linarith import Mathlib.Tactic.Ring import Mathlib.Analysis.Calculus.ContDiff.Operations import Mathlib.Analysis.Calculus.Deriv.Prod import Mathlib.Analysis.Calculus.MeanValue import Mathlib.Data.Fin.VecNotation import Mathlib.Tactic.FinCases import Mathlib.Tactic.FunProp import Mathlib.Analysis.SpecialFunctions.Pow.Deriv import Mathlib.Tactic.FieldSimp import Mathlib.Analysis.SpecialFunctions.Integrals.Basic import Mathlib.Analysis.ODE.ExistUnique import Mathlib.Analysis.Calculus.FDeriv.Partial import Mathlib.Analysis.Calculus.ImplicitContDiff import Mathlib.Analysis.Calculus.Deriv.Inv import Mathlib.Tactic.LinearCombination import Mathlib.Analysis.SpecialFunctions.Arcosh import Mathlib.MeasureTheory.Integral.IntervalIntegral.FundThmCalculus import Mathlib.Analysis.Calculus.InverseFunctionTheorem.Deriv import Mathlib.Analysis.Calculus.Deriv.MeanValue import Mathlib.Topology.Order.IntermediateValue import Mathlib.Topology.Order.Compact import Mathlib.Topology.Instances.Real.Lemmas import Mathlib.Tactic.NormNum import Mathlib.Analysis.SpecialFunctions.Arsinh import Mathlib.Analysis.SpecialFunctions.Sqrt import Mathlib.MeasureTheory.Integral.IntervalIntegral.DistLEIntegral import Mathlib.Analysis.ODE.Gronwall import Mathlib.Data.Matrix.Mul import Mathlib.Tactic.GCongr import Mathlib.Analysis.Calculus.Deriv.Slope import Mathlib.Topology.Order.OrderClosed import Mathlib.Analysis.Calculus.FDeriv.Symmetric import Mathlib.Tactic.Module import Mathlib.Analysis.SpecialFunctions.Log.Deriv noncomputable section open BianchiIX open Set
theorem BianchiIX.entranceReturn_decay {y : ProjectiveState}
(hk : 7 / 4 ≤ coreRadius (y 0) (y 2)) (hm : 1 ≤ y 0)
(hu : 0 ≤ y 1 ∧ y 1 ≤ 1 / 10000) (hv : 0 < y 2 ∧ y 2 < 1)
(hw : 0 ≤ y 3 ∧ y 3 ≤ 1 / 10000) :
let k := coreRadius (y 0) (y 2)
let L := -Real.log (y 2)
entranceReturnState y 1 ≤ y 1 * y 2 * Real.exp (-k * L / 3) ∧
entranceReturnState y 3 ≤ y 3 * y 2 * Real.exp (-L / k) := by sorry