Uniform entrance phase columns for cyclic terminal endpoints
ProvedBianchiIX.exists_terminal_phase_column_inputsFor 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
For , define
For any real height , put
The infimum uses the total real-order convention. Let mean that is the least element of , and, writing , that
All vector and operator norms use the finite-product supremum norms.
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.
For define the cyclic chart by
Its normalized symmetry is
Put and
Write and .
On the invariant plane with zero active wall, use , the inclusion and the restriction . Define
Write , , , for their explicit Jacobian and Hessian expressions. The denominator derivatives are and . The exact original-time boundary flow and its projected variation are
For a fixed scale , set , and . For directions , define
All vector norms are sup norms, and operator norms are induced by them. Write , , , and
The closed boundary region is . The boundary projection is the limit of as , using the total limit convention of the formal definitions.
Set , , and . An admissible inverse at is at , maps to , and is a two-sided local inverse of ; its derivative is the inverse of the triangular derivative of . In the following notation put and . Define
For let
Set , , , and . The positive wall multipliers are defined by integrating the two multiplicative wall rates along the exact exit flow, so that and . Write for . For let . All derivatives of maps with subscript hold this height fixed. A cone direction is with , . There are and such that for , there is valid for , , , , . The tail is valid, , and satisfies , , . There is an admissible inverse at such that, for , is at and
import Definitions.Def_BianchiIX_Dynamics_Normalized import Definitions.Def_BianchiIX_Dynamics_AxisMaps import Definitions.Def_BianchiIX_Algebra_CoreAngle import Definitions.Def_BianchiIX_Dynamics_ProjectiveState import Definitions.Def_BianchiIX_Dynamics_MaximalFlow import Definitions.Def_BianchiIX_TerminalConnectionData import Definitions.Def_BianchiIX_Dynamics_CoreTail import Definitions.Def_BianchiIX_Dynamics_EntranceReturn import Definitions.Def_BianchiIX_TerminalConeData import Definitions.Def_BianchiIX_EntrancePhaseResponseData import Mathlib.MeasureTheory.Integral.IntervalIntegral.FundThmCalculus import Mathlib.Analysis.Calculus.Deriv.Inv import Mathlib.Analysis.Calculus.Deriv.Mul import Mathlib.Analysis.Calculus.Deriv.MeanValue 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.Tactic.FieldSimp import Mathlib.Tactic.LinearCombination import Mathlib.Analysis.SpecialFunctions.Sqrt import Mathlib.Analysis.Calculus.ImplicitContDiff import Mathlib.Analysis.Calculus.Deriv.Prod import Mathlib.Analysis.SpecialFunctions.ExpDeriv import Mathlib.Analysis.SpecialFunctions.Arsinh 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.SpecialFunctions.Arcosh import Mathlib.Analysis.Calculus.InverseFunctionTheorem.Deriv import Mathlib.Analysis.SpecialFunctions.Pow.Deriv import Mathlib.Analysis.SpecialFunctions.Integrals.Basic import Mathlib.Analysis.ODE.ExistUnique import Mathlib.Analysis.Calculus.FDeriv.Partial import Mathlib.MeasureTheory.Integral.IntervalIntegral.DistLEIntegral import Mathlib.Analysis.ODE.Gronwall import Mathlib.Data.Matrix.Mul import Mathlib.Topology.Instances.Real.Lemmas import Mathlib.Tactic.GCongr import Mathlib.Analysis.Calculus.Deriv.Slope import Mathlib.Topology.Order.OrderClosed import Mathlib.Topology.Order.IntermediateValue import Mathlib.Topology.MetricSpace.Cauchy import Mathlib.Analysis.Calculus.FDeriv.Symmetric import Mathlib.Tactic.NormNum import Mathlib.Analysis.Calculus.ContDiff.Comp import Mathlib.Analysis.Calculus.Deriv.Comp import Mathlib.Analysis.Calculus.UniformLimitsDeriv import Mathlib.Analysis.Calculus.ParametricIntervalIntegral import Mathlib.Topology.Order.Compact import Mathlib.MeasureTheory.Integral.DominatedConvergence import Mathlib.Topology.Order.ProjIcc import Mathlib.Analysis.Calculus.InverseFunctionTheorem.ContDiff import Mathlib.Analysis.SpecialFunctions.ImproperIntegrals import Mathlib.Analysis.Calculus.ParametricIntegral import Mathlib.MeasureTheory.Integral.Bochner.ContinuousLinearMap import Mathlib.Analysis.Calculus.Deriv.Pi import Mathlib.MeasureTheory.Integral.IntervalIntegral.IntegrationByParts import Mathlib.Tactic.Module import Mathlib.Analysis.SpecialFunctions.Log.Deriv import Mathlib.Analysis.SpecialFunctions.Log.Basic import Mathlib.Analysis.SpecialFunctions.Pow.Real 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.Data.Real.Basic import Mathlib.Tactic.Positivity import Mathlib.Algebra.BigOperators.Fin import Mathlib.Analysis.SpecialFunctions.Trigonometric.ArctanDeriv import Mathlib.Analysis.SpecialFunctions.Trigonometric.DerivHyp import Mathlib.Topology.MetricSpace.Thickening import Mathlib.LinearAlgebra.Matrix.ToLin noncomputable section open BianchiIX
theorem BianchiIX.exists_terminal_phase_column_inputs :
∃ A ≥ (1 : ℝ), ∃ δ > (0 : ℝ), δ ≤ 1 / 1000 ∧ ∀ η₀ : ℝ,
(0 < η₀ ∧ η₀ ≤ δ) → ∀ J : ℕ, 2 ≤ J →
∃ ε > (0 : ℝ), ∀ η α b u w : ℝ,
η₀ ≤ η → η ≤ δ → (0 < α ∧ α ≤ 1) → 0 < b →
b ≤ ε * α ^ (2 * J) → |u| + |w| ≤ b → 0 < u → 0 < w →
let Y : ExitTailState := ![2 + 2 * α, u, w]
let h := η * α ^ J
let y := terminalCyclicInput h Y
coreTailValid h Y ∧ 0 < projectiveCycleDenom (coreTailState h Y) ∧
(0 < y 1 ∧ y 1 ≤ 1) ∧ (0 < y 2 ∧ y 2 < 1) ∧ (0 < y 3 ∧ y 3 ≤ 1) ∧ y 3 ≤ y 1 ∧
∃ Ψ : ProjectiveState → ProjectiveState, EntranceRadialInverseAt y Ψ ∧
let z := terminalEntranceInput h Y
let F := fun z => coreRadius (entranceReturnState (Ψ z) 0) (entranceReturnState (Ψ z) 2)
ContDiffAt ℝ 2 F z ∧ |F z - z 0| ≤ A * α * y 1 * y 2 ∧
|fderiv ℝ F z (Pi.single 0 1) - 1| ≤ A * y 1 * y 2 ∧
|fderiv ℝ F z (Pi.single 1 1)| ≤ A * α * y 2 ∧
|fderiv ℝ F z (Pi.single 2 1)| ≤ A * y 1 ∧
|fderiv ℝ F z (Pi.single 3 1)| ≤ A * α * y 1 * y 2 := by sorry