Bilin Form Integrand mul smooth eq
DeGiorgi.bilinFormIntegrand_mul_smooth_eq
Plain-language statement
Pointwise expansion of the bilinear-form integrand against a smooth-product witness η · w. The weak gradient of η · w is η · ∇w + (∇η) · w (from mul_smooth_bounded_p), so the bilinear-form integrand is: ⟪A∇u, ∇(η·w)⟫ = η · ⟪A∇u, ∇w⟫ + w · ⟪A∇u, ∇η⟫ where ∇η is encoded as the vector with components (fderiv ℝ η x)(single i 1). Note: this...
Exact Lean statement
theorem bilinFormIntegrand_mul_smooth_eq
{Ω : Set E} (hΩ : IsOpen Ω)
{u w η : E → ℝ}
(A : EllipticCoeff d Ω)
(hu : MemW1pWitness 2 u Ω)
(hw : MemW1pWitness 2 w Ω)
(hη : ContDiff ℝ (⊤ : ℕ∞) η)
{C₀ C₁ : ℝ} (hC₀ : 0 ≤ C₀) (hC₁ : 0 ≤ C₁)
(hη_bound : ∀ x, |η x| ≤ C₀)
(hη_grad_bound : ∀ x, ‖fderiv ℝ η x‖ ≤ C₁)
(hp : (1 : ENNReal) ≤ 2) :
∀ x, bilinFormIntegrandOfCoeff A hu
(hw.mul_smooth_bounded_p (d := d) hp hΩ hη hC₀ hC₁ hη_bound hη_grad_bound) x =
η x * bilinFormIntegrandOfCoeff A hu hw x +
w x * ⟪matMulE (A.a x) (hu.weakGrad x),
(WithLp.toLp 2 fun i =>
(fderiv ℝ η x) (EuclideanSpace.single i 1) : E)⟫_ℝFormal artifact
Lean source
theorem bilinFormIntegrand_mul_smooth_eq {Ω : Set E} (hΩ : IsOpen Ω) {u w η : E → ℝ} (A : EllipticCoeff d Ω) (hu : MemW1pWitness 2 u Ω) (hw : MemW1pWitness 2 w Ω) (hη : ContDiff ℝ (⊤ : ℕ∞) η) {C₀ C₁ : ℝ} (hC₀ : 0 ≤ C₀) (hC₁ : 0 ≤ C₁) (hη_bound : ∀ x, |η x| ≤ C₀) (hη_grad_bound : ∀ x, ‖fderiv ℝ η x‖ ≤ C₁) (hp : (1 : ENNReal) ≤ 2) : ∀ x, bilinFormIntegrandOfCoeff A hu (hw.mul_smooth_bounded_p (d := d) hp hΩ hη hC₀ hC₁ hη_bound hη_grad_bound) x = η x * bilinFormIntegrandOfCoeff A hu hw x + w x * ⟪matMulE (A.a x) (hu.weakGrad x), (WithLp.toLp 2 fun i => (fderiv ℝ η x) (EuclideanSpace.single i 1) : E)⟫_ℝ := by intro x -- The weakGrad of mul_smooth_bounded_p at x is: -- η x • hw.weakGrad x + toLp 2 (fun i => fderiv ℝ η x (single i 1) * w x) -- The bilinear-form integrand ⟪A∇u, ∇(η·w)⟫ distributes over this sum -- by bilinearity of the inner product. simp only [bilinFormIntegrandOfCoeff, MemW1pWitness.mul_smooth_bounded_p, inner_add_right, inner_smul_right] congr 1 -- Factor w(x) out: ⟪v, toLp(f_i * c)⟫ = c * ⟪v, toLp(f_i)⟫ -- The goal is: Σᵢ ⟪row_i, f_i * w⟫ = (Σᵢ ⟪row_i, f_i⟫) * w -- where ⟪a, b⟫_ℝ = a * b, so ⟪a, f_i * w⟫ = a * (f_i * w) = (a * f_i) * w = ⟪a, f_i⟫ * w simp only [PiLp.inner_apply, matMulE, Matrix.mulVec] rw [Finset.mul_sum] congr 1 ext i -- ⟪a, b * c⟫_ℝ = c * ⟪a, b⟫_ℝ for reals rw [show (fderiv ℝ η x) (EuclideanSpace.single i 1) * w x = w x • ((fderiv ℝ η x) (EuclideanSpace.single i 1)) from by rw [smul_eq_mul]; ring, inner_smul_right]- Project
- DeGiorgi
- License
- Apache-2.0
- Commit
- 4c1b3077d378
- Source
- DeGiorgi/WeakFormulation/WeightedEstimates.lean:40-75
Reuse this declaration
Bring the exact result into your workflow
The import identifies the source module. Your project still needs the pinned package dependency shown on this page.
What this badge means
This completion status comes from the project or community source. It has not yet been represented here as an independent rebuild and axiom audit.
Continue in this project
Related declarations
Ae eq of tendsto e Lp Norm sub
BareFunction.ae_eq_of_tendsto_eLpNorm_sub
Plain-language statement
Lp limit uniqueness: if f_n → g₁ and f_n → g₂ in eLpNorm, then g₁ =ᵐ g₂.
Source project: DeGiorgi
Person-level attribution pending.
E Lp Norm pi le sum component
BareFunction.eLpNorm_pi_le_sum_component
Plain-language statement
Vector eLpNorm ≤ sum of component eLpNorms for Pi-valued functions. Uses eLpNorm_mono_real for the pointwise bound together with eLpNorm_sum_le for ℝ-valued functions, avoiding Pi instance synthesis.
Source project: DeGiorgi
Person-level attribution pending.
Mem Lp of tendsto e Lp Norm
BareFunction.memLp_of_tendsto_eLpNorm
Plain-language statement
If f n → g in eLpNorm and each f n ∈ Lp, then g ∈ Lp, provided g is AEStronglyMeasurable. Avoids the Lp type entirely. The key observation: eLpNorm (f n - g) → 0 means eLpNorm (f N - g) < 1 for some N. Then eLpNorm g ≤ eLpNorm (f N - g) + eLpNorm (f N) < ∞.
Source project: DeGiorgi
Person-level attribution pending.