Documentation

LeanPool.HighContrastHomogenization.Entry.Response.Direct.TriadicRefinementIncrement

High-contrast homogenization: Entry.Response.Direct.TriadicRefinementIncrement #

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

Refining the cutoff's oscillation split by one triadic generation #

A flat average, over the depth-m triadic subcells of the terminal cell, of a weight c·w against the cell average of an integrable function, is unchanged when each depth-m cell is refined into its own triadic subcells one generation further; this is the bookkeeping that the descendant telescoping of p.response.transfer sums generation by generation. Exact partition averaging turns the (φ-1)-weighted average of a density D on a cell into the normalized average, over its own triadic subcells, of the per-subcell means of φ-1 and of D, so replacing each subcell's mean of φ-1 by that of the coarser cell containing it leaves only a 3^{-n} remainder. Because a response cutoff of scale 3^t is Lipschitz with constant 32 d^2 Θ 3^{-t}, the increment of the cutoff's cell average between a cell and the coarser cell of the previous generation containing it is bounded by that constant times the finer cell's diameter, read off at the depth H + n + 1 the descendant sum of p.response.transfer actually uses.

Refining a weighted flat cell average by one triadic generation #

The descendant telescoping of p.response.transfer compares the cutoff cell averages at two consecutive generations. The bookkeeping it needs is that a flat average over the depth-m subcells of the terminal cell, of a weight c w against the cell average of a fixed integrable function f, is unchanged when each depth-m cell is refined into its 3 ^ d children: the weight is then read at the parent index.

avg_{w ∈ box m}  c w · ⨍_{V^m_w} f  =  avg_{W ∈ box (m+1)}  c (parent W) · ⨍_{V^{m+1}_W} f.

The proof uses only the landed partition of the centred terminal cell (avsum_volumeAverage_eq), applied once at depth m and once at depth m + 1.

The parent of a cell of the triadic box lies in the coarser box. If W indexes a cell of depth m + 1 inside the terminal cell, its parent index of depth m indexes a cell of the same terminal cell.

A triadic cell sits in its parent. The aligned adapted cell of generation k at index W is contained in the aligned adapted cell of generation k + 1 at the parent index.

theorem HCPolySupport.HighContrast.Multiscale.avsum_fiber_volumeAverage_eq {d : ℕ} [NeZero d] {q : Mat d} (hq : IsUnit q) (t : ℤ) (m : ℕ) (w : Fin d → ℤ) (hw : w ∈ triadicIndexBox d m) {f : Vec d → ℝ} (hf : MeasureTheory.IntegrableOn f (adaptedCell q t) MeasureTheory.volume) :
(↑(triadicIndexBox d (m + 1)).card)⁻¹ * ∑ W ∈ triadicIndexBox d (m + 1) with Transport.gridParent W = w, volumeAverage (adaptedCellAtCenter q (t - ↑(m + 1)) W) f = (↑(triadicIndexBox d m).card)⁻¹ * volumeAverage (adaptedCellAtCenter q (t - ↑m) w) f

The children of one triadic cell carry its cell average. Summing the cell averages of f over the depth-(m+1) cells whose parent index is w, normalised by the number of depth-(m+1) cells, gives the cell average of f over the depth-m cell at w, normalised by the number of depth-m cells.

theorem HCPolySupport.HighContrast.Multiscale.avsum_weighted_volumeAverage_succ_eq {d : ℕ} [NeZero d] {q : Mat d} (hq : IsUnit q) (t : ℤ) (m : ℕ) (c : (Fin d → ℤ) → ℝ) {f : Vec d → ℝ} (hf : MeasureTheory.IntegrableOn f (adaptedCell q t) MeasureTheory.volume) :
(↑(triadicIndexBox d m).card)⁻¹ * ∑ w ∈ triadicIndexBox d m, c w * volumeAverage (adaptedCellAtCenter q (t - ↑m) w) f = (↑(triadicIndexBox d (m + 1)).card)⁻¹ * ∑ W ∈ triadicIndexBox d (m + 1), c (Transport.gridParent W) * volumeAverage (adaptedCellAtCenter q (t - ↑(m + 1)) W) f

Refining a weighted flat cell average by one generation. The flat average over the depth-m subcells of a weight against the cell average of f equals the flat average over the depth-(m+1) subcells of the same weight read at the parent index.

The cutoff fluctuation splits into cell means plus a 3^{-n} remainder #

The scale gain of the cutoff estimate of p.response.transfer. Exact partition averaging over the generation-(t - n) triadic subdivision writes the (φ - 1)-weighted average of a density D as the normalized average of the per-cell weighted averages of φ - 1 and D. On each descendant cell V, replacing φ - 1 by its own V-mean costs only the oscillation of φ on V, which is at most 32 d² responseCutoffProfileConst 3^{-n}. Summing back gives the stated remainder bound; the remaining cell-mean term is the one cancelled in expectation by stationarity.

theorem HCPolySupport.HighContrast.Multiscale.abs_sub_volumeAverage_le_of_isResponseCutoff {d : ℕ} {qq : Mat d} (hq : IsUnit qq) {t : ℤ} {φ : Vec d → ℝ} (h : IsResponseCutoff qq t φ) (n : ℕ) (w : Fin d → ℤ) (hvol : (MeasureTheory.volume (adaptedCellAtCenter qq (t - ↑n) w)).toReal ≠ 0) (hfin : MeasureTheory.volume (adaptedCellAtCenter qq (t - ↑n) w) ≠ ⊤) (hint : MeasureTheory.IntegrableOn φ (adaptedCellAtCenter qq (t - ↑n) w) MeasureTheory.volume) {x : Vec d} (hx : x ∈ adaptedCellAtCenter qq (t - ↑n) w) :
|φ x - volumeAverage (adaptedCellAtCenter qq (t - ↑n) w) φ| ≤ 32 * ↑d ^ 2 * responseCutoffProfileConst * 3 ^ (-↑n)

Across a descendant adapted cell adaptedCellAtCenter qq (t - n) w, a cutoff φ of the response class IsResponseCutoff qq t φ deviates from its cell mean by at most 32 d² responseCutoffProfileConst 3^{-n}. This is the oscillation input to the scale gain of the cutoff estimate of p.response.transfer.

theorem HCPolySupport.HighContrast.Multiscale.abs_volumeAverage_sub_one_mul_sub_avsum_le {d : ℕ} [NeZero d] {qq : Mat d} (hq : IsUnit qq) (t : ℤ) (n : ℕ) {φ : Vec d → ℝ} (hφ : IsResponseCutoff qq t φ) {D : Vec d → ℝ} (hD : ∀ (x : Vec d), 0 ≤ D x) (hDint : MeasureTheory.IntegrableOn D (adaptedCell qq t) MeasureTheory.volume) (hφDint : MeasureTheory.IntegrableOn (fun (x : Vec d) => (φ x - 1) * D x) (adaptedCell qq t) MeasureTheory.volume) (hDat : ∀ w ∈ triadicIndexBox d n, MeasureTheory.IntegrableOn D (adaptedCellAtCenter qq (t - ↑n) w) MeasureTheory.volume) (hφat : ∀ w ∈ triadicIndexBox d n, MeasureTheory.IntegrableOn φ (adaptedCellAtCenter qq (t - ↑n) w) MeasureTheory.volume) (hφDat : ∀ w ∈ triadicIndexBox d n, MeasureTheory.IntegrableOn (fun (x : Vec d) => (φ x - 1) * D x) (adaptedCellAtCenter qq (t - ↑n) w) MeasureTheory.volume) (hvol : ∀ w ∈ triadicIndexBox d n, (MeasureTheory.volume (adaptedCellAtCenter qq (t - ↑n) w)).toReal ≠ 0) (hfin : ∀ w ∈ triadicIndexBox d n, MeasureTheory.volume (adaptedCellAtCenter qq (t - ↑n) w) ≠ ⊤) :
|(volumeAverage (adaptedCell qq t) fun (x : Vec d) => (φ x - 1) * D x) - (↑(triadicIndexBox d n).card)⁻¹ * ∑ w ∈ triadicIndexBox d n, (volumeAverage (adaptedCellAtCenter qq (t - ↑n) w) fun (x : Vec d) => φ x - 1) * volumeAverage (adaptedCellAtCenter qq (t - ↑n) w) D| ≤ 32 * ↑d ^ 2 * responseCutoffProfileConst * 3 ^ (-↑n) * volumeAverage (adaptedCell qq t) D

The exact partition average of the (φ - 1)-weighted density over the adapted parent cell differs from the normalized sum of the products of the per-cell means of φ - 1 and of D by at most 32 d² responseCutoffProfileConst 3^{-n} times the parent average of D. This is the scale gain of the cutoff estimate of p.response.transfer.

The cutoff cell averages of a cell and of a coarser cell containing it #

The descendant telescoping of p.response.transfer needs, at the passage from generation t - m to generation t - m - 1, the increment of the cutoff cell averages over a subcell W of the generation-(t - m) aligned cell. Because the cutoff class IsResponseCutoff qq t φ carries derivatives at the scale 3^t, φ varies over the cell by at most 32 d² Θ 3^{-m}; the two averages of φ over W and over the cell therefore differ by at most that oscillation. This is the weight that makes the descendant sum converge with the printed weights 3^{3(k-s)/2}.

theorem HCPolySupport.HighContrast.Multiscale.abs_volumeAverage_sub_one_sub_volumeAverage_sub_one_le {d : ℕ} {qq : Mat d} (hq : IsUnit qq) {t : ℤ} {φ : Vec d → ℝ} (hφ : IsResponseCutoff qq t φ) (m : ℕ) (v : Fin d → ℤ) {W : Set (Vec d)} (hsub : W ⊆ adaptedCellAtCenter qq (t - ↑m) v) (hvol : (MeasureTheory.volume (adaptedCellAtCenter qq (t - ↑m) v)).toReal ≠ 0) (hfin : MeasureTheory.volume (adaptedCellAtCenter qq (t - ↑m) v) ≠ ⊤) (hint : MeasureTheory.IntegrableOn φ (adaptedCellAtCenter qq (t - ↑m) v) MeasureTheory.volume) (hWvol : (MeasureTheory.volume W).toReal ≠ 0) (hWfin : MeasureTheory.volume W ≠ ⊤) (hWint : MeasureTheory.IntegrableOn φ W MeasureTheory.volume) :
|(volumeAverage W fun (x : Vec d) => φ x - 1) - volumeAverage (adaptedCellAtCenter qq (t - ↑m) v) fun (x : Vec d) => φ x - 1| ≤ 32 * ↑d ^ 2 * responseCutoffProfileConst * 3 ^ (-↑m)

The cutoff cell average of a subcell differs from that of the cell by the cutoff oscillation. If V is the aligned adapted cell of generation t - m at the index v and W ⊆ V has positive finite volume, the cutoff cell averages of φ - 1 over W and over V differ by at most 32 d² Θ 3^{-m}. This is the weight of the generation-(t-m-1) term of the descendant sum of p.response.transfer.

The descendant weight of the cutoff-mean row at the carriers #

The descendant sum of p.response.transfer runs over the generations below the scale-s cells, i.e. over the depths H + n + 1 of the terminal cell. Its weight at depth H + n + 1 is the increment of the cutoff cell averages between a cell and the cell of the previous generation containing it. The cutoff class bounds that increment by 32 d² Θ 3^{-(H+n)}, which is the shape K · 3^{-n} the descendant row consumes, with K = 32 d² Θ 3^{-H} carrying the printed factor 3^{-H}.

theorem HCPolySupport.HighContrast.Multiscale.abs_cutoff_weight_increment_le {d : ℕ} {qq : Mat d} (hq : IsUnit qq) {t : ℤ} {φ : Vec d → ℝ} (hφ : IsResponseCutoff qq t φ) (H n : ℕ) (W : Fin d → ℤ) :
|(volumeAverage (adaptedCellAtCenter qq (t - ↑(H + n + 1)) W) fun (x : Vec d) => φ x - 1) - volumeAverage (adaptedCellAtCenter qq (t - ↑(H + n)) (Transport.gridParent W)) fun (x : Vec d) => φ x - 1| ≤ 32 * ↑d ^ 2 * responseCutoffProfileConst * 3 ^ (-↑H) * 3 ^ (-↑n)

The descendant weight of the cutoff-mean row. At the generation t - (H + n + 1) the increment of the cutoff cell averages between a cell and its parent is at most (32 d² Θ 3^{-H}) · 3^{-n}. This is the weight of the depth-n term of the descendant sum of p.response.transfer.