ClauseOneConditional #
Ported from scottnarmstrong/Superdiffusion at 7f20476385d4af418f110303085ad0740c9eba46. Module imports, support namespace and local option directives adapted for Lean Pool.
The conditional clause-(i) endpoint of the annular decomposition #
This module composes the proved clause-(i) chain into a single conditional
endpoint: the almost-sure, [0,∞]-valued, representative-side display of
DisplaySlots.clauseOne_representative_display_latticeMax, carrying exactly
the four remaining inputs as named hypotheses and nothing else.
What is discharged here #
Starting from ClauseOne.clauseOne_bound (18 binders + two event memberships
after the A5c feed), this module closes:
- the good-event plumbing — the two event memberships
hG1/hG2and the threshold nonnegativity0 ≤ T, from a single membershipω ∈ Support.goodEventBase M Ccg m s εthrough the proved projectionsSupport.goodEventBase_subset_eventG1/…_subset_eventG2, at thee.lambda.good.eventsamplitudeT = s ε √c⋆ γ^{−1/2}; - the σ-continuity slot
hshom(with its companionhsig0), from A5a'sexists_shomSlot_geat the floor6, so the endpoint's regime hypothesis is the printedγ ≤ C^{−1} c⋆^{10}withC = C_shom^{10}; - the constant bookkeeping at the pinned family
C_bf = 1,K_L2 = 1,K_gn = 81, with the two output constants given by the explicit formulasclauseOneLegConstantandclauseOneOutConstant; - the
∀ L/Eventuallywrapper: the pointwise chain holds for everyL ≥ m, with nom ≤ Lside condition beyond the one the display carries.
What remains, and why #
hpref/hpret— the Step-1 annular cover at the concrete gridsAssemblyFeed.jLegField/AssemblyFeed.jLegTranspose; the covering and centering subadditivity (hcov/hcen) is not established here;huglyf— the per-cube ugly estimate at the pinned carriersDisplaySlots.annularErrorLatticeMax,EventBudgets.annularL2Block,EventBudgets.annularGradBlock; the unit-cube-to-lattice-cube transport is not established here;huglyt— its transpose leg, likewise open (CoarseGraining has no transpose-invariance theorem for the error functionals).
Together with the printed ranges (s ≤ 1, 8γ ≤ s, c⋆^4 ≤ 6,
1 ≤ |log γ|, 0 ≤ ε) and the good-event membership, these are the only
inputs of the endpoint.
Wrinkle of the graph's clause-(ii) route, recorded #
goodEventBase_subset_annularEvent is the containment the manuscript leaves
unstated: 𝒢(m; s, ε) ⊆ 𝒢₀(m) ∩ 𝒢₁(m; s, √c⋆ γ^{−1/2}), i.e. the event of the
printed clause-(i) display, valid because s ε ≤ 1.
Part A -- the 𝒢₁ amplitude of e.lambda.good.events #
The square of the 𝒢₁ amplitude, in the form the third and fourth
right-hand terms of clause (i) consume: T² = s² ε² c⋆ γ^{-1}.
Wrinkle of the clause-(ii) route, made explicit. The good event 𝒢(m; s, ε) of e.lambda.good.events sits inside the event of the printed clause-(i)
display, whose 𝒢₁ amplitude is the larger √c⋆ γ^{-1/2}. The manuscript
uses this containment without stating it.
Part B -- the two output constants at the pinned family #
The per-leg constant of ClauseOne.clauseOne_bound's hCleg binder at the
pinned C_bf = 1: C_leg = 24 C₁ (1 + K_tail) C₂.
Equations
Instances For
The output constant of the clause-(i) composite at the pinned family
C_bf = 1, K_L2 = 1, K_gn = 81:
C_out = 2 C_leg · 7000 C_shom².
Because A5a delivers C_shom ≥ 6, this single value dominates all three
hCout binders: 7000 C_shom² ≥ 252000 ≥ 51264 = 4608 K_L2 + 576 K_gn ≥ 1.
Equations
- Algsuperdiff.Section4.Provider.Annular.clauseOneOutConstant C₁ C₂ Ktail Cshom = 2 * Algsuperdiff.Section4.Provider.Annular.clauseOneLegConstant C₁ C₂ Ktail * (7000 * Cshom ^ 2)