Canonical compact reflection with phase and cone estimates
ProvedBianchiIX.exists_compact_reflection_estimatesFor 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.
Define the core radius, angle, and clock factor by
For , write , , and . All quotients use the total convention .
The core state space is with coordinates . Define
For fixed put , , , and define
For real , put and define
Write , , and let be the maximal solution of with initial value at and domain . Put
Write , , and . Define
The entrance parametrization and radial exit factor are
For projective initial data , put
Coordinates of three-vectors are indexed by ; projective coordinates are indexed by .
For , put , , and
The infimum uses the total real-order convention. Write when is the least element of , every lies in with , the active wall is strictly above one for , and
All vector and operator norms below use the finite-product supremum norm. For 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
For a normalized trajectory write
For , set , , and
Let mean that this infimum is a least element, the full interval lies in the maximal domain with positive , the growing wall is below one before the endpoint, and its normalized-time derivative is strictly positive at the endpoint. The infimum has its total real-order meaning.
Write , , , and . The physical connection coordinates are
Below denotes the canonical core return time from and its radial and wall coordinates. Let , , , and . A cone direction at has , , . For a map with positive output walls, its positive cone property means has positive radial component and for .
The reflection conclusions with constant are: is the least positive time at which ; ; are at ; and
Every cone direction gives with
There are such that these conclusions hold whenever and .
import Definitions.Def_BianchiIX_Dynamics_Normalized import Definitions.Def_BianchiIX_Algebra_Projective import Definitions.Def_BianchiIX_Algebra_Coordinates import Definitions.Def_BianchiIX_Algebra_CoreAngle import Definitions.Def_BianchiIX_Dynamics_ProjectiveState import Definitions.Def_BianchiIX_Algebra_MatchingPhase import Definitions.Def_BianchiIX_Dynamics_ProjectiveRegularity import Definitions.Def_BianchiIX_Dynamics_MaximalFlow import Definitions.Def_BianchiIX_Dynamics_CoreAngle import Definitions.Def_BianchiIX_Dynamics_Events import Definitions.Def_BianchiIX_Dynamics_ProjectiveFlowVariation import Definitions.Def_BianchiIX_Dynamics_ProjectiveReflection import Definitions.Def_BianchiIX_Dynamics_ConnectionExistence import Definitions.Def_BianchiIX_Dynamics_ConnectionEvents import Definitions.Def_BianchiIX_Dynamics_CoreEntryDifferential import Definitions.Def_BianchiIX_Dynamics_CoreTail import Definitions.Def_BianchiIX_Dynamics_ConnectionReturn import Definitions.Def_BianchiIX_Dynamics_EntranceReturn import Definitions.Def_BianchiIX_Dynamics_CompactConnectionReturn import Definitions.Def_BianchiIX_Dynamics_ConnectionPhysicalReturn import Definitions.Def_BianchiIX_Dynamics_CoreConnectionChart import Definitions.Def_BianchiIX_EntrancePhaseResponseData import Definitions.Def_BianchiIX_EraReturnData import Mathlib.Analysis.Calculus.FDeriv.Symmetric import Mathlib.Analysis.Calculus.Deriv.Mul import Mathlib.Tactic.NormNum import Mathlib.Analysis.Calculus.Deriv.Prod import Mathlib.Tactic.Module import Mathlib.Analysis.Calculus.Deriv.Pow import Mathlib.Analysis.Calculus.Deriv.Add import Mathlib.Analysis.Real.Sqrt import Mathlib.Tactic.Linarith import Mathlib.Tactic.Ring import Mathlib.Analysis.SpecialFunctions.Arsinh import Mathlib.Analysis.SpecialFunctions.Sqrt import Mathlib.Tactic.FieldSimp import Mathlib.Analysis.Calculus.ContDiff.Operations import Mathlib.Analysis.Calculus.MeanValue import Mathlib.Data.Fin.VecNotation import Mathlib.Tactic.FinCases import Mathlib.Tactic.FunProp 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.Analysis.SpecialFunctions.Pow.Deriv import Mathlib.Analysis.SpecialFunctions.Integrals.Basic import Mathlib.Analysis.ODE.ExistUnique import Mathlib.Data.Matrix.Mul import Mathlib.Algebra.BigOperators.Fin import Mathlib.Analysis.Calculus.FDeriv.Partial import Mathlib.Analysis.Calculus.ImplicitContDiff import Mathlib.Data.Real.Basic import Mathlib.Analysis.ODE.Gronwall import Mathlib.Analysis.SpecialFunctions.Trigonometric.ArctanDeriv import Mathlib.Analysis.SpecialFunctions.Trigonometric.DerivHyp import Mathlib.Analysis.SpecialFunctions.Log.Basic import Mathlib.Topology.Instances.Real.Lemmas import Mathlib.MeasureTheory.Integral.IntervalIntegral.DistLEIntegral import Mathlib.Tactic.GCongr import Mathlib.Analysis.Calculus.Deriv.Slope import Mathlib.Topology.Order.OrderClosed import Mathlib.Topology.Order.IntermediateValue import Mathlib.Analysis.SpecialFunctions.Log.Deriv import Mathlib.Analysis.SpecialFunctions.ExpDeriv import Mathlib.Topology.Order.Compact import Mathlib.Topology.Order.ProjIcc import Mathlib.Analysis.SpecificLimits.Basic import Mathlib.Analysis.Normed.Operator.Basic import Mathlib.LinearAlgebra.Matrix.Notation import Mathlib.Analysis.Normed.Module.FiniteDimension import Mathlib.LinearAlgebra.Determinant import Mathlib.Topology.Instances.Matrix import Mathlib.LinearAlgebra.Matrix.Trace import Mathlib.Analysis.Calculus.FDeriv.Analytic import Mathlib.Topology.Algebra.Module.Determinant import Mathlib.Analysis.Calculus.Deriv.Pi import Mathlib.Topology.MetricSpace.Thickening import Mathlib.Analysis.Calculus.ParametricIntervalIntegral import Mathlib.MeasureTheory.Integral.DominatedConvergence import Mathlib.Analysis.Calculus.ContDiff.Deriv import Mathlib.Analysis.SpecialFunctions.Pow.Continuity import Mathlib.Topology.MetricSpace.Cauchy import Mathlib.Analysis.Calculus.ContDiff.Comp import Mathlib.Analysis.Calculus.Deriv.Comp import Mathlib.Analysis.Calculus.UniformLimitsDeriv import Mathlib.Analysis.Calculus.InverseFunctionTheorem.ContDiff import Mathlib.Analysis.SpecialFunctions.ImproperIntegrals import Mathlib.Analysis.Calculus.ParametricIntegral import Mathlib.MeasureTheory.Integral.Bochner.ContinuousLinearMap import Mathlib.MeasureTheory.Integral.IntervalIntegral.IntegrationByParts import Mathlib.Tactic.Positivity import Mathlib.Analysis.SpecialFunctions.Pow.Real noncomputable section open BianchiIX open Set
theorem BianchiIX.exists_compact_reflection_estimates :
∃ ε > (0 : ℝ), ∃ C > (0 : ℝ), ∀ Y : CoreAngleState,
(31 / 8 ≤ Y 0 ∧ Y 0 ≤ 6) → (0 < Y 1 ∧ Y 1 ≤ ε) → (0 < Y 2 ∧ Y 2 ≤ ε) →
IsLeast {t : ℝ | 0 < t ∧ projectiveOriginalFlow (coreTailEntry Y) 0 t 3 = 1}
(reflectionReturnTime Y) ∧
coreRadiusEntry (reflectionReturnState Y) =
projectiveReflection (projectiveOriginalFlow (coreTailEntry Y) 0 (reflectionReturnTime Y)) ∧
ContDiffAt ℝ 2 reflectionReturnTime Y ∧ ContDiffAt ℝ 2 reflectionReturnState Y ∧
|reflectionReturnState Y 0 - (Y 0 - 2)| ≤ C * (Y 1 + Y 2) / Y 0 ∧
(∀ i : Fin 2, 0 < reflectionReturnState Y i.succ ∧ reflectionReturnState Y i.succ ≤ Y i.succ) ∧
∀ v : CoreAngleState, v 0 = 1 → |v 1| ≤ Real.sqrt (Y 1) → |v 2| ≤ Real.sqrt (Y 2) →
let d := fderiv ℝ reflectionReturnState Y v
1 / 2 ≤ d 0 ∧ |d 0 - 1| ≤ C * Real.sqrt (Y 1 + Y 2) / Y 0 ∧
∀ i : Fin 2, |d i.succ| ≤ Real.sqrt (reflectionReturnState Y i.succ) * d 0 := by sorry