OAI/Analysis/SignedDisk/DyadicHats1.lean
47 declarations, 0 contain sorry, 0 declared as axioms
- def
OAI.SignedDisk.DyadicHats.pointline 29 - def
OAI.SignedDisk.DyadicHats.boxNormline 30 - lemma
OAI.SignedDisk.DyadicHats.boxNorm_nonnegline 32 - lemma
OAI.SignedDisk.DyadicHats.boxNorm_le_normline 33 - lemma
OAI.SignedDisk.DyadicHats.norm_le_two_boxNormline 35 - lemma
OAI.SignedDisk.DyadicHats.boxNorm_add_leline 40 - lemma
OAI.SignedDisk.DyadicHats.boxNorm_negline 44 - lemma
OAI.SignedDisk.DyadicHats.boxNorm_sub_commline 45 - lemma
OAI.SignedDisk.DyadicHats.hat_pos_iffline 48 - lemma
OAI.SignedDisk.DyadicHats.hat_ne_zero_iffline 63 - lemma
OAI.SignedDisk.DyadicHats.support_hat_subsetline 71 - lemma
OAI.SignedDisk.DyadicHats.hasCompactSupport_hatline 77 - lemma
OAI.SignedDisk.DyadicHats.lipschitz_hatline 83Source documentation
Globally uniform spatial Lipschitz bound for the literal bilinear hats.
lemma lipschitz_hat {r : ℝ} (hr : 0 < r) (p : ℤ × ℤ) : LipschitzWith (Real.toNNReal (2/r)) (hat r p) := by …Mentions: OAI.SignedDisk.DyadicHats.hat
- lemma
OAI.SignedDisk.DyadicHats.step_localityline 116 - def
OAI.SignedDisk.DyadicHats.childrenline 147Source documentation
Literal nine-child support of an adjacent dyadic refinement row.
def children (p : ℤ × ℤ) : Finset (ℤ × ℤ) := …
- lemma
OAI.SignedDisk.DyadicHats.tent_half_zeroline 150 - lemma
OAI.SignedDisk.DyadicHats.step_zero_of_not_childline 160 - lemma
OAI.SignedDisk.DyadicHats.hat_refine_finiteline 168 - def
OAI.SignedDisk.DyadicHats.vectorMassline 175Source documentation
The vector mass of the actual density, not an abstract additive tree.
def vectorMass (h : ℂ → ℂ) (r : ℝ) (p : ℤ × ℤ) : ℂ := ∫ y, hat r p y • h y
Mentions: OAI.SignedDisk.DyadicHats.hat
- def
OAI.SignedDisk.DyadicHats.scalarMassline 177 - lemma
OAI.SignedDisk.DyadicHats.integrable_hat_smulline 179 - lemma
OAI.SignedDisk.DyadicHats.vectorMass_refineline 185 - lemma
OAI.SignedDisk.DyadicHats.scalarMass_le_integralline 196 - lemma
OAI.SignedDisk.DyadicHats.sum_scalarMass_leline 204Source documentation
Any finite set of roots carries at most the total L1 density, uniformly in the scale. This proves the full-grid mass budget once finite support is used.
lemma sum_scalarMass_le {h : ℂ → ℂ} (hh : Integrable h) (r : ℝ) (S : Finset (ℤ × ℤ)) : ∑ p ∈ S, scalarMass h r p ≤ ∫ y, ‖h y‖ := by …Mentions: OAI.SignedDisk.DyadicHats.scalarMass
- lemma
OAI.SignedDisk.DyadicHats.scalarMass_refine_leline 221 - def
OAI.SignedDisk.DyadicHats.boundedIndicesline 229Source documentation
A finite index set that contains every hat meeting a fixed bounded region.
def boundedIndices (r R : ℝ) : Finset (ℤ × ℤ) := …
- lemma
OAI.SignedDisk.DyadicHats.mem_boundedIndicesline 232 - lemma
OAI.SignedDisk.DyadicHats.vectorMass_zero_of_not_indexline 257 - lemma
OAI.SignedDisk.DyadicHats.finite_vectorMass_supportline 271Source documentation
Compactly supported actual densities have finitely many nonzero vector masses at each positive scale.
lemma finite_vectorMass_support {h : ℂ → ℂ} (hc : HasCompactSupport h) {r : ℝ} (hr : 0 < r) : (Function.support (vectorMass h r)).Finite := by …Mentions: OAI.SignedDisk.DyadicHats.vectorMass
- theorem
OAI.SignedDisk.LipschitzWith.integral_fderiv_mul_eq_negline 293Source documentation
Genuine integration by parts for Lipschitz weights and compact Lipschitz potentials. Differentiability is required only almost everywhere, and follows from Rademacher rather than being a new premise.
theorem integral_fderiv_mul_eq_neg (hf : LipschitzWith L f) (hg : LipschitzWith K g) (hgc : HasCompactSupport g) (v : E) : (∫ x, fderiv ℝ f x v * g x ∂μ) = -∫ x, fderiv ℝ g x v * f x ∂μ := by … - theorem
OAI.SignedDisk.LipschitzWith.locallyIntegrable_gradientline 306Source documentation
The total gradient version obtained from Riesz and measurable fderiv is locally integrable, including on the nondifferentiability set.
theorem locallyIntegrable_gradient (hf : LipschitzWith L f) : LocallyIntegrable (gradient f) μ := by … - theorem
OAI.SignedDisk.LipschitzWith.integrable_gradientline 317 - theorem
OAI.SignedDisk.LipschitzWith.integral_mul_fderiv_eq_negline 324 - def
OAI.SignedDisk.DyadicHats.indexBoxline 340 - abbrev
OAI.SignedDisk.DyadicHats.Gridline 342 - lemma
OAI.SignedDisk.DyadicHats.parent_in_boxline 344 - lemma
OAI.SignedDisk.DyadicHats.grid_step_columnline 370Source documentation
Restriction to a finite box retains the exact column normalization of the positive dyadic refinement matrix; it does not normalize its rows.
lemma grid_step_column (N : ℕ) (q : Grid N) : (∑ p : Grid N, step p q) = 1 := by …
Mentions: OAI.SignedDisk.DyadicHats.Grid, OAI.SignedDisk.DyadicHats.step
- lemma
OAI.SignedDisk.DyadicHats.mem_indexBox_of_leline 378 - lemma
OAI.SignedDisk.DyadicHats.hat_mul_zero_outsideline 388 - lemma
OAI.SignedDisk.DyadicHats.density_partition_gridline 398 - lemma
OAI.SignedDisk.DyadicHats.density_refine_gridline 406 - lemma
OAI.SignedDisk.DyadicHats.integrable_hat_mulline 418 - def
OAI.SignedDisk.DyadicHats.scaleline 424 - lemma
OAI.SignedDisk.DyadicHats.scale_posline 425 - lemma
OAI.SignedDisk.DyadicHats.scale_succline 426 - lemma
OAI.SignedDisk.DyadicHats.le_scaleline 430 - lemma
OAI.SignedDisk.DyadicHats.scale_index_boundline 434