Coarse-graining support: #
Support.Deterministic.ConstantCoefficientDirichletBesov.StandardOverlapComparison
Imported from the Apache-2.0 CoarseGraining development at commit
c7ddd76c08ade64fed1b8d2ca51be14dfee8deb4.
Standard/overlapping positive Besov comparison #
The key geometric observation is that every ordinary descendant cube appears as the overlapping cube of its middle child. This file starts the comparison API with the exact middle-child identities.
@[simp]
@[simp]
@[simp]
@[simp]
@[simp]
theorem
HCPolySupport.overlapCubeAverage_middleChildCube
{d : ℕ}
(Q : TriadicCube d)
(f : Vec d → ℝ)
:
@[simp]
theorem
HCPolySupport.overlapCubeAverageVec_middleChildCube
{d : ℕ}
(Q : TriadicCube d)
(u : Vec d → Vec d)
:
@[simp]
theorem
HCPolySupport.overlapCubeFluctuationVec_middleChildCube
{d : ℕ}
(Q : TriadicCube d)
(u : Vec d → Vec d)
:
@[simp]
theorem
HCPolySupport.overlapCubeLpNorm_middleChildCube
{d : ℕ}
{E : Type u_1}
[NormedAddCommGroup E]
(Q : TriadicCube d)
(p : ENNReal)
(u : Vec d → E)
:
theorem
HCPolySupport.overlapCubeLpNorm_middleChildCube_fluctuation
{d : ℕ}
(Q : TriadicCube d)
(u : Vec d → Vec d)
:
overlapCubeLpNorm (middleChildCube Q) 2 (overlapCubeFluctuationVec (middleChildCube Q) u) = cubeLpNorm Q 2 (cubeFluctuationVec Q u)
theorem
HCPolySupport.overlapCentersAtDepth_card_le_three_pow_mul_descendantsAtDepth_card
{d : ℕ}
(Q : TriadicCube d)
(j : ℕ)
:
theorem
HCPolySupport.cubeBesovPositiveVectorDepthAverage_le_three_pow_mul_overlapping
{d : ℕ}
(Q : TriadicCube d)
(u : Vec d → Vec d)
(j : ℕ)
:
theorem
HCPolySupport.sq_cubeBesovPositiveVectorDepthSeminorm_le_three_pow_mul_overlapping
{d : ℕ}
(Q : TriadicCube d)
(s : ℝ)
(u : Vec d → Vec d)
(j : ℕ)
:
cubeBesovPositiveVectorDepthSeminorm Q s u j ^ 2 ≤ 3 ^ d * cubeBesovOverlappingPositiveVectorDepthSeminorm Q s u j ^ 2
theorem
HCPolySupport.sq_cubeBesovPositiveVectorPartialSeminormTwo_le_three_pow_mul_overlapping
{d : ℕ}
(Q : TriadicCube d)
(s : ℝ)
(N : ℕ)
(u : Vec d → Vec d)
:
cubeBesovPositiveVectorPartialSeminormTwo Q s N u ^ 2 ≤ 3 ^ d * cubeBesovOverlappingPositiveVectorPartialSeminormTwo Q s N u ^ 2
theorem
HCPolySupport.cubeBesovPositiveVectorPartialSeminormTwo_le_sqrt_three_pow_mul_overlapping
{d : ℕ}
(Q : TriadicCube d)
(s : ℝ)
(N : ℕ)
(u : Vec d → Vec d)
:
cubeBesovPositiveVectorPartialSeminormTwo Q s N u ≤ √(3 ^ d) * cubeBesovOverlappingPositiveVectorPartialSeminormTwo Q s N u
theorem
HCPolySupport.cubeBesovPositiveVectorPartialSeminormTwo_bddAbove_of_overlapping
{d : ℕ}
(Q : TriadicCube d)
(s : ℝ)
(u : Vec d → Vec d)
(hBdd : BddAbove (Set.range fun (N : ℕ) => cubeBesovOverlappingPositiveVectorPartialSeminormTwo Q s N u))
:
BddAbove (Set.range fun (N : ℕ) => cubeBesovPositiveVectorPartialSeminormTwo Q s N u)
theorem
HCPolySupport.cubeBesovPositiveVectorSeminormTwo_le_sqrt_three_pow_mul_overlapping
{d : ℕ}
(Q : TriadicCube d)
(s : ℝ)
(u : Vec d → Vec d)
(hBdd : BddAbove (Set.range fun (N : ℕ) => cubeBesovOverlappingPositiveVectorPartialSeminormTwo Q s N u))
:
cubeBesovPositiveVectorSeminormTwo Q s u ≤ √(3 ^ d) * cubeBesovOverlappingPositiveVectorSeminormTwo Q s u
theorem
HCPolySupport.positiveVectorNormTwo_le_sqrt_three_pow_mul_overlappingNorm
{d : ℕ}
(Q : TriadicCube d)
(s : ℝ)
(u : Vec d → Vec d)
(hBdd : BddAbove (Set.range fun (N : ℕ) => cubeBesovOverlappingPositiveVectorPartialSeminormTwo Q s N u))
:
√(vecNormSq (cubeAverageVec Q u)) + cubeBesovPositiveVectorSeminormTwo Q s u ≤ √(3 ^ d) * cubeBesovOverlappingPositiveVectorNormTwo Q s u