Quadratic upper
DeGiorgi.EllipticCoeff.quadratic_upper
Plain-language statement
Pointwise quadratic upper bound derived from the mixed bound.
Exact Lean statement
theorem quadratic_upper :
∀ᵐ x ∂(MeasureTheory.volume.restrict Ω), ∀ ξ : AmbientSpace d,
⟪ξ, matMulE (A.a x) ξ⟫_ℝ ≤ A.Λ * ‖ξ‖ ^ 2Formal artifact
Lean source
theorem quadratic_upper : ∀ᵐ x ∂(MeasureTheory.volume.restrict Ω), ∀ ξ : AmbientSpace d, ⟪ξ, matMulE (A.a x) ξ⟫_ℝ ≤ A.Λ * ‖ξ‖ ^ 2 := by filter_upwards [A.coercive, A.mulVec_sq_le] with x hx_coercive hx_mul ξ let q : ℝ := ⟪ξ, matMulE (A.a x) ξ⟫_ℝ let m : ℝ := ‖matMulE (A.a x) ξ‖ let n : ℝ := ‖ξ‖ have hq_nonneg : 0 ≤ q := by exact le_trans (mul_nonneg A.lam_nonneg (sq_nonneg ‖ξ‖)) (by simpa [q] using hx_coercive ξ) have hq_le : q ≤ n * m := by simpa [q, m, n, abs_of_nonneg hq_nonneg, mul_comm] using (abs_real_inner_le_norm ξ (matMulE (A.a x) ξ)) have hm_sq : m ^ 2 ≤ A.Λ * q := by simpa [m, q] using hx_mul ξ have hn_nonneg : 0 ≤ n := norm_nonneg ξ have hm_nonneg : 0 ≤ m := norm_nonneg (matMulE (A.a x) ξ) have hq_mul : q * q ≤ (A.Λ * n ^ 2) * q := by nlinarith [hq_le, hm_sq, hn_nonneg, hm_nonneg, A.Λ_nonneg] have hupper : q ≤ A.Λ * n ^ 2 := by by_cases hq_zero : q = 0 · have hnonneg : 0 ≤ A.Λ * n ^ 2 := mul_nonneg A.Λ_nonneg (sq_nonneg n) simpa [hq_zero] using hnonneg · have hq_pos : 0 < q := lt_of_le_of_ne hq_nonneg (by simpa [eq_comm] using hq_zero) exact le_of_mul_le_mul_right (by simpa [pow_two, mul_assoc, mul_left_comm, mul_comm] using hq_mul) hq_pos simpa [q, n] using hupper- Project
- DeGiorgi
- License
- Apache-2.0
- Commit
- 4c1b3077d378
- Source
- DeGiorgi/EllipticCoefficients.lean:189-215
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.