Documentation

LeanPool.HighContrastHomogenization.Entry.Response.Cutoff.ResponseCutoffEstimate

High-contrast homogenization: Entry.Response.Cutoff.ResponseCutoffEstimate #

Imported from the Apache-2.0 HighContrastHomogenization development at commit 7a13dbcd8d6609264a713373f5c69ceeac870472.

The cutoff estimate #

The cutoff decomposition of the centred response, before the final scalar inequality, bounds |Jtilde^Β±(e)| by the three error rows β€” the energy-defect row, the cutoff-mean row, and the cutoff-oscillation row β€” plus the cutoff pairing term; combining that bound with the constant 32 d^2 3^{-t} needed to construct a genuine cutoff, in place of the naive class's vacuous one, closes it under a weak-pairing hypothesis on the maximizer family. This file then states and proves the cutoff estimate e.response.cutoff.estimate itself, one of the inputs to the response decomposition adapted_response_core: the bound on the centred response Jtilde^Β±(e) in terms of the energy-defect row, the cutoff-mean row, and the cutoff pairing term, closed on the response's own concrete data.

The variational calculation of AK.HC (3.45)-(3.54) with the cutoff decomposition #

(3.46) and the mean cancellation of p.response.transfer.

The two cutoff-mean terms e2 below are exactly the two rows re-typed here onto the current carriers respTauMinus/Plus (ResponseBlockObjects.lean), respEJMinus/Plus, respLsMinus/Plus, the paper's 𝓛_s^Β±, built from respSourceLoad).

The three error terms of p.response.transfer are, in order:

The fourth summand on the right is the cutoff pairing term e4, bounded by C W^Β±; the mean-cancellation assertion is exactly that NO further term (the difference between the inserted means P^Β±, Q^Β± and the actual annealed means) appears in this decomposition.

theorem HCPolySupport.HighContrast.Multiscale.abs_respCenteredJ_le_cutoffRows (d : β„•) [NeZero d] (hd : 2 ≀ d) :
βˆƒ (C : ℝ), 0 < C ∧ βˆ€ (P : MeasureTheory.Measure (CoeffSpace d)) [MeasureTheory.IsProbabilityMeasure P] (jStar : β„•) (F : BlockMat d) (H : β„•) (s t : β„€) (e : Vec d) (Ο† : Vec d β†’ ℝ), t = s + ↑H β†’ IsResponseCutoff (respGrid jStar F) t Ο† β†’ IsStationaryLaw P β†’ IsUnit (respGrid jStar F) β†’ ↑jStar ≀ s β†’ 2 * d ≀ 3 ^ jStar β†’ Matrix.PosDef (explicitCanonicalMetric F) β†’ Matrix.PosDef (toFullBlockMat F) β†’ (βˆƒ (Ξ³ : ℝ) (E : BlockMat d) (Ξ¨ : ℝ β†’ ℝ) (Kg : ℝ) (Src : CoeffSpace d β†’ ℝ), CoarseEllipticityDagger P Ξ³ E Ξ¨ Kg Src) β†’ (βˆ€ (Y : BlockVec d), Summable (respSourceLoadSummand P jStar F s (respCoeffMinus F) Y)) β†’ (βˆ€ (Y : BlockVec d), Summable (respSourceLoadSummand P jStar F s (respCoeffPlus F) Y)) β†’ 0 ≀ respTauMinus P jStar F s t e β†’ 0 ≀ respTauPlus P jStar F s t e β†’ Summable (respSourceLoadSummand P jStar F s (respCoeffMinus F) (respYMinus P jStar F t e)) β†’ Summable (respSourceLoadSummand P jStar F s (respCoeffPlus F) (respYPlus P jStar F t e)) β†’ (βˆ€ (k : β„€), ↑jStar ≀ k β†’ k ≀ t β†’ HasIntegrableCoarseBlock P (respCell jStar F k)) β†’ (βˆ€ (k : β„€) (w : Fin d β†’ β„€), HasIntegrableCoarseBlock P (adaptedCellAtCenter (respGrid jStar F) k w)) β†’ (βˆ€ (k : β„€), ↑jStar ≀ k β†’ k ≀ t β†’ Matrix.PosDef (toFullBlockMat (respMean P jStar F k))) β†’ MeasureTheory.Integrable (fun (a : CoeffSpace d) => respJ (respGrid jStar F) t (respP (respMean P jStar F t) e) (respqMinus P jStar F t e) (respCoeffMinus F a)) P β†’ MeasureTheory.Integrable (fun (a : CoeffSpace d) => respJ (respGrid jStar F) s (respP (respMean P jStar F t) e) (respqMinus P jStar F t e) (respCoeffMinus F a)) P β†’ MeasureTheory.Integrable (fun (a : CoeffSpace d) => respJ (respGrid jStar F) t (respP (respMean P jStar F t) e) (respqPlus P jStar F t e) (respCoeffPlus F a)) P β†’ MeasureTheory.Integrable (fun (a : CoeffSpace d) => respJ (respGrid jStar F) s (respP (respMean P jStar F t) e) (respqPlus P jStar F t e) (respCoeffPlus F a)) P β†’ βˆ€ (uM : (a : CoeffSpace d) β†’ AHarmonicFunction (respCoeffMinus F a) (respCell jStar F t)), (βˆ€ (a : CoeffSpace d), IsResponseMaximizer (respCell jStar F t) (respP (respMean P jStar F t) e) (respqMinus P jStar F t e) (respCoeffMinus F a) (uM a)) β†’ MeasureTheory.Integrable (fun (a : CoeffSpace d) => |cutoffPairingOnCellAux (respCell jStar F t) Ο† (respYMinus P jStar F t e) (respCoeffMinus F a) (uM a)|) P β†’ βˆ€ (uP : (a : CoeffSpace d) β†’ AHarmonicFunction (respCoeffPlus F a) (respCell jStar F t)), (βˆ€ (a : CoeffSpace d), IsResponseMaximizer (respCell jStar F t) (respP (respMean P jStar F t) e) (respqPlus P jStar F t e) (respCoeffPlus F a) (uP a)) β†’ MeasureTheory.Integrable (fun (a : CoeffSpace d) => |cutoffPairingOnCellAux (respCell jStar F t) Ο† (respYPlus P jStar F t e) (respCoeffPlus F a) (uP a)|) P β†’ |respCenteredJMinus P jStar F t e| ≀ C * (respTauMinus P jStar F s t e + √(respTauMinus P jStar F s t e * respEJMinus P jStar F t e) + 3 ^ (-↑H) * respEJMinus P jStar F t e) + C * √(respTauMinus P jStar F s t e * respLsMinus P jStar F s t e) + C * (3 ^ (-↑H) * √(respEJMinus P jStar F t e * respLsMinus P jStar F s t e)) + ∫ (a : CoeffSpace d), |cutoffPairingOnCellAux (respCell jStar F t) Ο† (respYMinus P jStar F t e) (respCoeffMinus F a) (uM a)| βˆ‚P ∧ |respCenteredJPlus P jStar F t e| ≀ C * (respTauPlus P jStar F s t e + √(respTauPlus P jStar F s t e * respEJPlus P jStar F t e) + 3 ^ (-↑H) * respEJPlus P jStar F t e) + C * √(respTauPlus P jStar F s t e * respLsPlus P jStar F s t e) + C * (3 ^ (-↑H) * √(respEJPlus P jStar F t e * respLsPlus P jStar F s t e)) + ∫ (a : CoeffSpace d), |cutoffPairingOnCellAux (respCell jStar F t) Ο† (respYPlus P jStar F t e) (respCoeffPlus F a) (uP a)| βˆ‚P

Cutoff rows (p.response.transfer; AK.HC (3.45)-(3.54) and (3.46)). The cutoff decomposition of the centred response, before Young's inequality: |Jtilde^Β±(e)| is bounded by the three error rows e1 + e2 + e3 plus the cutoff pairing term e4.

The original formulation of IsResponseCutoff was vacuous: it asked a function supported in a cube of side 3^t to have mean one while its pullback was only 3⁻ᡗ-Lipschitz, and such a function is at most 1 / 2 everywhere. With the cutoff constant 32 * d ^ 2 * 3 ^ (-t), exists_isResponseCutoff above constructs a member of the class, and what remains is the genuine variational calculation of AK.HC (3.45)-(3.54).

Without the additional integrability hypotheses the theorem is false: three of the four summands on each right-hand side are Bochner integrals whose integrands have no sample-uniform bound (respJ is an sSup over an uncountable admissible class, and a point of CoeffSpace d is only QUALITATIVELY elliptic -- see the collapse diagnostics above), so on a law where they fail to be P-integrable the junk value 0 zeroes every error row and the statement forces Jtilde^Β±(e) = 0, which the purely algebraic left-hand side does not satisfy. That implication is machine-checked above by hc3_h8c_minus_row_forces_centeredJ_eq_zero.

The CONCLUSION is unchanged, character for character. Eight premises are ADDED, all of them raw-derivable at the sole call site response_cutoff_estimate (ResponseCutoffEstimate.lean), and every one of them is discharged there:

new premisedischarged at the call site from
IsStationaryLaw Praw.stat
IsUnit (respGrid jStar F)raw.hj, raw.symm, raw.pos (the existing hq)
(jStar : β„€) ≀ sraw.hs_lo plus the two range hypotheses Ξ΅ ∈ (0, S.eps0], `Οƒ ∈ (0,
Ξ΅], which response_cutoff_estimate` now carries -- see below
the two Summable (respSourceLoadSummand...)hLB, i.e. RespLoadBound, which now carries
the summability of the source-load family as two further conjuncts. Without them respSourceLoad
is the junk value 0 of a divergent tsum and the two cutoff-mean rows assert that the centred
cutoff mean vanishes
HasIntegrableCoarseBlock P (respCell jStar F k) on [jStar, t]
Annealed.hasIntegrableCoarseBlock_adapted from raw.stat, raw.ell, raw.hj
(toFullBlockMat (respMean P jStar F k)).PosDef on [jStar, t]Annealed.adaptedMean_posDef
from the same three fields
the four Integrable (fun a => respJ... u... (respCoeff± F a)) P, u ∈ {s, t}the
raw-consuming lemma integrable_respJ_respCell above
the two Integrable (fun a => |cutoffPairingOnCellAux...|) Pthe raw-consuming lemma
integrable_abs_cutoffPairingOnCell above

IsStationaryLaw P is not decoration. The mean-cancellation sentence this decomposition rests on (p.response.transfer, "The constant cell means cancel after expectation, BECAUSE the scale-s translations are integral and (Ο†)_{U_t} = 1") is a stationarity argument: E[(X)_{z+U_s}] is independent of the translation z only for a stationary law, which in this checkout is Annealed.annealedBlock_adaptedCellAtCenter (HCPoly/Entry/Annealed/AnnealedBlockOrder.lean, whose hypotheses are exactly hstat, raw.hj and (jStar : β„€) ≀ j -- hence also the third premise above). Without it the e2 row has no reason to close.

hjs : jStar ≀ s is not directly available in raw as raw.hs_lo: as respAllScale_window (HCPoly/Entry/Response/Core/EnergyDefectBound.lean) records, raw.hs_lo reads jStar + ⌈B log_3(2 + Pi)βŒ‰ ≀ s and is VACUOUS unless 1 ≀ B, which comes only from SelectionData.one_le_B0, which is stated only for Ξ΅ ∈ (0, S.eps0] and Οƒ ∈ (0, Ξ΅]. response_cutoff_estimate did not carry those two ranges. They have therefore been ADDED to it, in the same position and with the same names as its siblings response_energy_and_defect and response_load_and_mean, and the one place that applies it (AdaptedResponseAssembly.lean, inside adapted_response_core_of_holes) passes the hΞ΅/hσΡ it already has in context. No statement is changed: adapted_response_core is untouched.

Seven further premises complete the variational calculation. The variational calculation e1 + e2 + e3 is closed: the energy-defect row e1 by CutoffEnergyDefectRowObligations, the cutoff-mean rows e2 + e3 by CutoffMeanRowCarriers, and the assembly by CutoffEstimateRowClosure. Seven premises are ADDED, all raw-derivable at the sole call site response_cutoff_estimate and all discharged there:

new premisedischarged at the call site from
2 ≀ d (on the theorem itself)_hd
2 * d ≀ 3 ^ jStarraw.hj (already used there for hq)
(explicitCanonicalMetric F).PosDef`Geometry.explicitCanonicalMetric_posDef raw.symm
raw.pos(already in scope ashm`)
(toFullBlockMat F).PosDefposDef_toFullBlockMat raw.symm raw.pos
βˆƒ Ξ³ E Ξ¨ Kg Src, CoarseEllipticityDagger P Ξ³ E Ξ¨ Kg Srcraw.ell
the two βˆ€ Y, Summable (respSourceLoadSummand … Y)
exists_summable_respSourceLoadSummand_all (OptimizerMeanRowCarriers) from raw.stat,
raw.ell, raw.hj, raw.hsrc, raw.cube, raw.hst and RespCalibrated
the two 0 ≀ respTauβˆ“RespEnergyDefect (hED), which response_cutoff_estimate already
carries

The βˆ€ Y summability is what the 2d coordinate instantiations of the oscillation half need: RespLoadBound supplies the source-load convergence only at Y = Y^βˆ“, and at Y = (0, Ξ΄_i) the generation layer is not dominated by the Y^βˆ“ layer. Supplying it forced response_cutoff_estimate to EXPORT its own source threshold Csrc, in the sibling pattern of response_source_load_bound and response_weak_estimate; AdaptedResponseAssembly takes the maximum, so nothing downstream sees the change. The conclusion of this theorem is unchanged, character for character, and RespCutoffBound is untouched.

The final combination of the cutoff rows and the weak pairing. #

The two branches combine the primal and adjoint rows of the cutoff decomposition against the weak quantity under one common constant. The conclusion is LITERALLY RespCutoffBound (CenteredEnergyIdentity.lean), i.e. exactly the payload of response_cutoff_estimate (ResponseCutoffEstimate.lean).

theorem HCPolySupport.HighContrast.Multiscale.respCutoffBound_of_cutoffRows_of_weakPairing {d : β„•} (C₁ Cβ‚‚ : ℝ) (hC₁ : 0 < C₁) (hCβ‚‚ : 0 < Cβ‚‚) (P : MeasureTheory.Measure (CoeffSpace d)) (jStar : β„•) (F : BlockMat d) (H : β„•) (s t : β„€) (e : Vec d) (eM eP : ℝ) (hΟ„M : 0 ≀ respTauMinus P jStar F s t e) (hΟ„P : 0 ≀ respTauPlus P jStar F s t e) (hEJM : 0 ≀ respEJMinus P jStar F t e) (hEJP : 0 ≀ respEJPlus P jStar F t e) (hLM : 0 ≀ respLsMinus P jStar F s t e) (hLP : 0 ≀ respLsPlus P jStar F s t e) (hWM : 0 ≀ respWMinus P jStar F t e) (hWP : 0 ≀ respWPlus P jStar F t e) (hrowsMinus : |respCenteredJMinus P jStar F t e| ≀ C₁ * (respTauMinus P jStar F s t e + √(respTauMinus P jStar F s t e * respEJMinus P jStar F t e) + 3 ^ (-↑H) * respEJMinus P jStar F t e) + C₁ * √(respTauMinus P jStar F s t e * respLsMinus P jStar F s t e) + C₁ * (3 ^ (-↑H) * √(respEJMinus P jStar F t e * respLsMinus P jStar F s t e)) + eM) (hrowsPlus : |respCenteredJPlus P jStar F t e| ≀ C₁ * (respTauPlus P jStar F s t e + √(respTauPlus P jStar F s t e * respEJPlus P jStar F t e) + 3 ^ (-↑H) * respEJPlus P jStar F t e) + C₁ * √(respTauPlus P jStar F s t e * respLsPlus P jStar F s t e) + C₁ * (3 ^ (-↑H) * √(respEJPlus P jStar F t e * respLsPlus P jStar F s t e)) + eP) (hweakMinus : eM ≀ Cβ‚‚ * respWMinus P jStar F t e) (hweakPlus : eP ≀ Cβ‚‚ * respWPlus P jStar F t e) :
RespCutoffBound (max C₁ Cβ‚‚) P jStar F H s t e

Cutoff bound from the rows and the weak pairing (p.response.transfer, e.response.cutoff.estimate). The three error rows of the cutoff decomposition plus the bound on the cutoff pairing term combine, under the common constant max C₁ Cβ‚‚, into RespCutoffBound.

eM/eP stand for the two expected cutoff pairing terms e4^βˆ“, so that hrowsMinus/hrowsPlus are the cutoff-row conclusions and hweakMinus/hweakPlus the weak-pairing conclusions. The nonnegativity hypotheses are the ones needed to collect the rows under a single constant; each is available in the calling context (RespLoadBound CenteredEnergyIdentity.lean and RespWeakBound already assert nonnegativity of 𝓛_s^Β± and of W^Β±).

The cutoff estimate #

The cutoff estimate e.response.cutoff.estimate, one part of the proof of adapted_response_core.

The cutoff estimate #

theorem HCPolySupport.HighContrast.Multiscale.response_cutoff_estimate (d : β„•) (_hd : 2 ≀ d) (Ξ³ : ℝ) (_hΞ³ : Ξ³ ∈ Set.Ico 0 1) (S : SelectionData) (_hS : S.Selects d Ξ³) (Cc Ce Cl Cld : ℝ) (_hCc : 0 < Cc) (_hCe : 0 < Ce) (_hCl : 0 < Cl) (_hCld : 0 < Cld) :
βˆƒ (Csrc : ℝ), 0 < Csrc ∧ βˆƒ (C : ℝ), 0 < C ∧ βˆ€ (Ξ΅ Οƒ : ℝ), Ξ΅ ∈ Set.Ioc 0 S.eps0 β†’ Οƒ ∈ Set.Ioc 0 Ξ΅ β†’ βˆ€ (Cglob Cprof Bresp : ℝ), 0 ≀ Cglob β†’ βˆ€ (H : β„•) (P : MeasureTheory.Measure (CoeffSpace d)) (E : BlockMat d) (Ξ¨ : ℝ β†’ ℝ) (Kg : ℝ) (Src : CoeffSpace d β†’ ℝ) (B : ℝ) (jStar : β„•) (F : BlockMat d) (s t : β„€), RawOutput d Ξ³ S Ξ΅ Οƒ Cglob Cprof Csrc H Bresp P E Ξ¨ Kg Src B jStar F s t β†’ RespCalibrated Cc P jStar F s t β†’ βˆ€ (e : Vec d), vecDot e e = 1 β†’ RespEnergyDefect Ce P jStar F s t e β†’ RespLoadMean Cl P jStar F s t e β†’ RespLoadBound Cld P jStar F s t e β†’ RespCutoffBound C P jStar F H s t e

The cutoff estimate (e.response.cutoff.estimate): `|Jtilde^Β±(e)| <= C(tau^Β± + (tau^Β± E[J_t^Β±])^{1/2} + (tau^Β± L_s^Β±)^{1/2}

  • 3^{-H}(E[J_t^Β±] + (E[J_t^Β±] L_s^Β±)^{1/2}) + W^Β±)`.

-- KERNEL. This is the second true analytic kernel: the variational calculation of \cite[(3.45)--(3.54)]{AK.HC} before Young's inequality, with \cite[(3.46)]{AK.HC} and \cite[Lemma A.1, (A.4)]{AK.HC}, is never reproved in the paper.

Route (p.response.transfer): choose a cutoff phi of the class IsResponseCutoff. The cutoff compares the terminal optimizer with its scale-s cell optimizers, and the quadratic-response identity measures the mean energy of their difference by 2 tau^Β±. Insert P^Β±, Q^Β± into the cutoff decomposition; the term containing the difference between these means and the actual annealed means is zero. Integration by parts and the direct full-dual pairing give E[|avg_{U_t} phi (grad v - P).(a grad v - Q)|] <= C W^Β±. The rounded/unrounded metric comparison costs only a dimensional constant, since |m^{-1/2}q||q^{-1}m^{1/2}| <= 3. Keeping the last product is essential.

The proof combines the pieces of the variational calculation: exists_isResponseCutoff (HCPoly/Entry/Response/Cutoff/ResponseCutoffExistence.lean) discharges the choice of cutoff at p.response.transfer, the maximizer-existence lemmas supply the two maximizer families, the cutoff-rows estimate gives the three error rows, the weak-pairing estimate gives the cutoff pairing term, and the two are collected under max C₁ Cβ‚‚. The invertibility of the selected grid comes from RawOutput.hj/symm/pos, and 0 ≀ W^Β± from the weak-pairing estimate itself (its left-hand side is an integral of absolute values).

The proof invokes abs_respCenteredJ_le_cutoffRows, integral_abs_cutoffPairingOnCell_le_respWeak, and the two raw-consuming integrability lemmas integrable_besovSeminorm_sq_respCell and integrable_abs_cutoffPairingOnCell. The theorem is axiom-clean.

It exports its own source threshold Csrc, in the same pattern as response_source_load_bound and response_weak_estimate. Two inputs need one: the measurability and L^Q(P)-integrability of the all-scale maximum, which the two raw-consuming lemmas consume, and the convergence of the source-load series at every dual vector, which the 2d coordinate readouts need and which is a theorem of annealedBlock_le_adaptedMean, whose threshold on j_* is not implied by an arbitrary Csrc. The exported threshold is the maximum of the two. AdaptedResponseAssembly in turn takes the maximum of the thresholds exported by the inputs it combines, so the interface seen by consumers is unchanged; the extra binder 0 ≀ Cglob matches response_source_load_bound's.