Local Hessian Flux and Trace Forcing Bounds
ProvedFunctionalInequalities.Analysis.localLp_hessian_flux_trace_forcing_readableThis is a technical compact-local integrability statement for weak Hessian evolution.
Let and let have compact-local components. Assume the inverse-Hessian derivatives
are compact-locally in , the inverse-Hessian entries are compact-locally in , and let be locally integrable. Define
and
where . Then, for every , each belongs locally to on compact sets and is locally integrable. This conclusion is purely analytic and assumes no classical Hessian regularity.
Original Lean conclusion excerpt
Within namespace FunctionalInequalities.Analysis. Shown in its original module context. Earlier hypotheses and the proof are omitted from this excerpt; the complete verified statement remains below.
let R := fun x => (hessianMatrix u x)⁻¹
let D := fun x k b a => -((R x * (Matrix.of fun c d => T x k c d) * R x) b a)
let J := fun x i j a => ∑ b : Fin n, R x b a * T x b i j
let C := fun x i j => Q x i j -
(∑ a : Fin n, ∑ b : Fin n, T x i a b * D x j b a) +
∑ b : Fin n, T x b i j * (∑ a : Fin n, D x a b a)
∀ i j : Fin n,
(∀ a : Fin n, ∀ S : Set (EuclideanSpace ℝ (Fin n)), IsCompact S →
MemLp (fun x => J x i j a) 2
((volume : Measure (EuclideanSpace ℝ (Fin n))).restrict S)) ∧
LocallyIntegrable (fun x => C x i j)
(volume : Measure (EuclideanSpace ℝ (Fin n)))
Module navigation
Module: Analysis/BakryEmery/IntegrationByParts/WeakHessianEvolution.
Definition modules: Analysis/BakryEmery/HessianOperator, Analysis/Operator/Coordinates.
Previous: hasWeakDerivAlong_mongeAmpere_first_rhs · Next: integral_array_pair_balance.
Source excerpt, lines 491–502 · Frozen source 408915f.
import Definitions.Def_KLSModular_FunctionalInequalities_Analysis_BakryEmery_IntegrationByParts_WeakHessianEvolution open MeasureTheory Set Filter open FunctionalInequalities.Probability.Stein set_option maxHeartbeats 800000
theorem FunctionalInequalities.Analysis.localLp_hessian_flux_trace_forcing_readable {n : ℕ}
{u : EuclideanSpace ℝ (Fin n) → ℝ}
(T : EuclideanSpace ℝ (Fin n) → Fin n → Fin n → Fin n → ℝ)
(hT2 : ∀ k i j : Fin n, ∀ S : Set (EuclideanSpace ℝ (Fin n)), IsCompact S →
MemLp (fun x => T x k i j) 2
((volume : Measure (EuclideanSpace ℝ (Fin n))).restrict S))
(hInv2 : ∀ k i j : Fin n, ∀ S : Set (EuclideanSpace ℝ (Fin n)), IsCompact S →
MemLp (fun x => -(((hessianMatrix u x)⁻¹ *
(Matrix.of fun a b => T x k a b) * (hessianMatrix u x)⁻¹) i j)) 2
((volume : Measure (EuclideanSpace ℝ (Fin n))).restrict S))
(hRtop : ∀ i j : Fin n, ∀ S : Set (EuclideanSpace ℝ (Fin n)), IsCompact S →
MemLp (fun x => (hessianMatrix u x)⁻¹ i j) (⊤ : ENNReal)
((volume : Measure (EuclideanSpace ℝ (Fin n))).restrict S))
(Q : EuclideanSpace ℝ (Fin n) → Fin n → Fin n → ℝ)
(hQ : ∀ i j : Fin n, LocallyIntegrable (fun x => Q x i j)
(volume : Measure (EuclideanSpace ℝ (Fin n)))) :
let R := fun x => (hessianMatrix u x)⁻¹
let D := fun x k b a => -((R x * (Matrix.of fun c d => T x k c d) * R x) b a)
let J := fun x i j a => ∑ b : Fin n, R x b a * T x b i j
let C := fun x i j => Q x i j -
(∑ a : Fin n, ∑ b : Fin n, T x i a b * D x j b a) +
∑ b : Fin n, T x b i j * (∑ a : Fin n, D x a b a)
∀ i j : Fin n,
(∀ a : Fin n, ∀ S : Set (EuclideanSpace ℝ (Fin n)), IsCompact S →
MemLp (fun x => J x i j a) 2
((volume : Measure (EuclideanSpace ℝ (Fin n))).restrict S)) ∧
LocallyIntegrable (fun x => C x i j)
(volume : Measure (EuclideanSpace ℝ (Fin n))) := by sorry