The literal polynomial first-packet scales satisfy every local, frequency and localized lower-bound guard after the final base choice.
The manuscript's literal first-packet scales have a fixed monomial frequency cost. The exponent and coefficient do not depend on J or X.
theorem
EulerBaseDatum.firstParameterSize_literal
(J : ℕ)
(hJ : 1 ≤ J)
(X : ℝ)
(hX : 1 ≤ X)
:
firstParameterSize (EulerPacketBaseGuardScales.baseHorizon J X) (X ^ (-1010)) (X ^ 1000) ≤ (7 + solutionLabelConstant) * X ^ 1010
First frequency constant, given by
frequencyConstant*(7+solutionLabelConstant)^frequencyPower.
Equations
Instances For
First frequency power, given by 1010*frequencyPower.
Instances For
theorem
EulerBaseDatum.first_frequency_guard_eventually
(J : ℕ)
(hJ : 1 ≤ J)
(D : ℕ)
(hD : ↑firstFrequencyPower < ↑D * (EulerPacketSourceFrequency.theta / 100))
:
∀ᶠ (X : ℝ) in Filter.atTop, EulerPacketInitializedOutputCost.uniformConstant * EulerPacketUniformSource.profileEnvelope
(firstParameterSize (EulerPacketBaseGuardScales.baseHorizon J X) (X ^ (-1010)) (X ^ 1000)) ^ EulerPacketInitializedOutputCost.uniformPower ≤ EulerPacketSourceFrequency.smallPower (X ^ D)
This remaining threshold depends only on the fixed base exponent, not on a parent or on a stage of the subsequent induction.
Literal initial error, given by (X^D)^(-(1/4 : ℝ)).
Equations
- EulerBaseDatum.literalInitialError D X = (X ^ D) ^ (-(1 / 4))
Instances For
First scale guards data, collecting x_one, radius_small, local_time, frequency,
label_frequency, radius_frequency and their compatibility conditions.
- frequency : EulerPacketSourceFrequency.UniversalFrequency (X ^ D)
- source_frequency : EulerPacketInitializedOutputCost.uniformConstant * EulerPacketUniformSource.profileEnvelope (firstParameterSize (EulerPacketBaseGuardScales.baseHorizon J X) (X ^ (-1010)) (X ^ 1000)) ^ EulerPacketInitializedOutputCost.uniformPower ≤ EulerPacketSourceFrequency.smallPower (X ^ D)
- localized : (initialCoefficientCost + literalInitialPressureCost D X) * (EulerPacketBaseGuardScales.baseHorizon J X ^ 2 / 2) + initialCoefficientCost * EulerPacketBaseGuardScales.baseHorizon J X + EulerMeanHarmonic.boundaryLocalizationC2 * (initialCoefficientCost + X ^ 1000 * EulerPacketFirstLowBounds.firstRatio + literalInitialError D X) * EulerPacketBaseGuardScales.baseRadius X ^ 3 * EulerPacketBaseGuardScales.baseHorizon J X ≤ 1 / 2
Instances For
theorem
EulerBaseDatum.eventually_firstScaleGuards
(J : ℕ)
(hJ : 1 ≤ J)
(D : ℕ)
(hD : 2000 ≤ D)
(hDfreq : ↑firstFrequencyPower < ↑D * (EulerPacketSourceFrequency.theta / 100))
:
∀ᶠ (X : ℝ) in Filter.atTop, FirstScaleGuards J D X