A Gaussian polynomial feature has its actual ambient L² derivative
Mathematical statement
Let E be a finite-dimensional real inner-product normed space with its Borel measurable structure, let γ be its centered standard Gaussian law with identity covariance, and let p be any finite real polynomial. For every ambient w and every direction v, both f_w(x)=p(⟨w,x⟩) and d_{w,v}(x)=p′(⟨w,x⟩)⟨v,x⟩ belong to L²(γ). There exist simultaneous membership witnesses and a field D(w):E→L²(γ) of continuous real linear maps such that D(w)v is exactly the class of d_{w,v}. The actual feature-class map Φ(w)=[f_w] is fully Fréchet differentiable at every ambient w, with derivative D(w). No feature membership, derivative membership, domination, differentiability or operator bound is an input.
Lean statement · actual_gaussian_polynomial_ridge_L2_frechet_derivative
Let E be a finite-dimensional real inner-product normed space with its Borel measurable structure, let γ be its centered standard Gaussian law with identity covariance, and let p be any finite real polynomial. For every ambient w and every direction v, both f_w(x)=p(⟨w,x⟩) and d_{w,v}(x)=p′(⟨w,x⟩)⟨v,x⟩ belong to L²(γ). There exist simultaneous membership witnesses and a field D(w):E→L²(γ) of continuous real linear maps such that D(w)v is exactly the class of d_{w,v}. The actual feature-class map Φ(w)=[f_w] is fully Fréchet differentiable at every ambient w, with derivative D(w). No feature membership, derivative membership, domination, differentiability or operator bound is an input.
Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.
theorem actual_gaussian_polynomial_ridge_L2_frechet_derivative
{E : Type*} [NormedAddCommGroup E] [InnerProductSpace ℝ E]
[FiniteDimensional ℝ E] [MeasurableSpace E] [BorelSpace E]
(p : Polynomial ℝ) :
let γ := ProbabilityTheory.stdGaussian E
let f : E → E → ℝ := fun w x => p.eval ⟪w,x⟫_ℝ
let df : E → E → E → ℝ := fun w v x => p.derivative.eval ⟪w,x⟫_ℝ * ⟪v,x⟫_ℝ
∃ hf : ∀ w, MemLp (f w) 2 γ,
∃ hdf : ∀ w v, MemLp (df w v) 2 γ,
∃ D : E → E →L[ℝ] Lp ℝ 2 γ,
(∀ w v, D w v = (hdf w v).toLp (df w v)) ∧
∀ w, HasFDerivAt (fun u => (hf u).toLp (f u)) (D w) wRead the complete claim and its hypotheses first, then open the numbered mathematical proof steps. Each step has an optional fold containing literal Lean implementation excerpts; the full theorem and module context remain available below.
Full assumptions and notation
All objects and hypotheses
- E has real inner-product normed, finite-dimensional and Borel structures; no positive dimension is required.
- p is any finite real polynomial, including zero, constant and non-even polynomials. The weight w ranges over all of E.
Mathematical proof
1. Produce Gaussian radial domination
Finite Gaussian norm moments and polynomial induction give L² radial envelopes on each bounded weight ball. Applying them to p and p′ times one radial factor produces the actual feature and directional-derivative memberships.
Corresponding Lean step
private theorem polynomial_radial_envelope
{E : Type*} [NormedAddCommGroup E] [InnerProductSpace ℝ E]
[FiniteDimensional ℝ E] [MeasurableSpace E] [BorelSpace E]
(p : Polynomial ℝ) (R : ℝ) (hR : 0 ≤ R) (k : ℕ) :
∃ B : E → ℝ, MemLp B 2 (stdGaussian E) ∧ (∀ x, 0 ≤ B x) ∧
∀ (w : E), ‖w‖ ≤ R → ∀ x,
‖p.eval ⟪w,x⟫_ℝ‖ * ‖x‖^k ≤ B x := by
classical
letI : CompleteSpace E := FiniteDimensional.complete ℝ E
letI : SecondCountableTopology E := inferInstance
let μ := stdGaussian E
have hpow (n : ℕ) : MemLp (fun x : E => ‖x‖^n) 2 μ := by
apply (memLp_two_iff_integrable_sq (by fun_prop)).2
have hi := (IsGaussian.memLp_id μ ((2*n : ℕ) : ℝ≥0∞)
(ENNReal.natCast_ne_top (2*n))).integrable_norm_pow' (p := 2*n)
convert hi using 1
funext x
simp only [id_eq, ← pow_mul, Nat.mul_comm n 2]
induction p using Polynomial.induction_on' with
| add p q hp hq =>
obtain ⟨B,hB,hB0,hBp⟩ := hp
obtain ⟨C,hC,hC0,hCq⟩ := hq
refine ⟨B+C,hB.add hC,fun x => add_nonneg (hB0 x) (hC0 x),?_⟩
intro w hw x
calc
‖(p+q).eval ⟪w,x⟫_ℝ‖ * ‖x‖^k ≤
(‖p.eval ⟪w,x⟫_ℝ‖+‖q.eval ⟪w,x⟫_ℝ‖) * ‖x‖^k := by
rw [Polynomial.eval_add]
exact mul_le_mul_of_nonneg_right (norm_add_le _ _) (pow_nonneg (norm_nonneg _) _)
_ = ‖p.eval ⟪w,x⟫_ℝ‖ * ‖x‖^k + ‖q.eval ⟪w,x⟫_ℝ‖ * ‖x‖^k := by ring
_ ≤ (B+C) x := add_le_add (hBp w hw x) (hCq w hw x)
| monomial n a =>
refine ⟨fun x => (‖a‖*R^n)*‖x‖^(n+k),
(hpow (n+k)).const_mul (‖a‖*R^n),fun x => by positivity,?_⟩
intro w hw x
have hi : ‖⟪w,x⟫_ℝ‖ ≤ R*‖x‖ :=
(norm_inner_le_norm (𝕜 := ℝ) w x).trans (mul_le_mul_of_nonneg_right hw (norm_nonneg _))
simp only [Polynomial.eval_monomial,norm_mul,norm_pow]
calc
‖a‖ * ‖⟪w,x⟫_ℝ‖^n * ‖x‖^k ≤ ‖a‖ * (R*‖x‖)^n * ‖x‖^k := by
gcongr
_ = (‖a‖*R^n)*‖x‖^(n+k) := by rw [pow_add,mul_pow];ring
private theorem ambient_feature_and_derivative_memLp
{E : Type*} [NormedAddCommGroup E] [InnerProductSpace ℝ E]
[FiniteDimensional ℝ E] [MeasurableSpace E] [BorelSpace E]
(p : Polynomial ℝ) :
(∀ w : E, MemLp (fun x : E => p.eval ⟪w,x⟫_ℝ) 2 (stdGaussian E)) ∧
∀ w v : E, MemLp (fun x : E =>
p.derivative.eval ⟪w,x⟫_ℝ * ⟪v,x⟫_ℝ) 2 (stdGaussian E) := by
constructor
· intro w
obtain ⟨B,hB,hB0,hBound⟩ :=
polynomial_radial_envelope (E := E) p ‖w‖ (norm_nonneg _) 0
apply hB.mono' (by fun_prop)
exact ae_of_all _ fun x => by simpa using hBound w le_rfl x
· intro w v
obtain ⟨B,hB,hB0,hBound⟩ :=
polynomial_radial_envelope (E := E) p.derivative ‖w‖ (norm_nonneg _) 1
apply (hB.const_mul ‖v‖).mono' (by fun_prop)
apply ae_of_all _
intro x
calc
‖p.derivative.eval ⟪w,x⟫_ℝ * ⟪v,x⟫_ℝ‖ =
‖p.derivative.eval ⟪w,x⟫_ℝ‖ * ‖⟪v,x⟫_ℝ‖ := norm_mul _ _
_ ≤ ‖p.derivative.eval ⟪w,x⟫_ℝ‖ * (‖v‖*‖x‖) :=
mul_le_mul_of_nonneg_left (norm_inner_le_norm (𝕜 := ℝ) v x) (norm_nonneg _)
_ = ‖v‖ * (‖p.derivative.eval ⟪w,x⟫_ℝ‖ * ‖x‖) := by ring
_ ≤ ‖v‖ * B x := mul_le_mul_of_nonneg_left
(by simpa using hBound w le_rfl x) (norm_nonneg _)
Literal implementation excerpt from AutoSamplingTheory/TechnicalLemmas/Probability/GaussianPolynomialDifferentiation.lean. Local names retain their surrounding theorem context; the complete theorem and exact module context are folded below. These excerpts are presentation, not extra theorem premises.
2. Build the represented bounded linear map
The directional scalar formula is linear in v. Its L² norm is bounded by an envelope norm times ‖v‖, so it extends directly to a continuous linear map with the required actual-class identity.
Corresponding Lean step
private theorem represented_derivative_clm
{E : Type*} [NormedAddCommGroup E] [InnerProductSpace ℝ E]
[FiniteDimensional ℝ E] [MeasurableSpace E] [BorelSpace E]
(p : Polynomial ℝ)
(hdf : ∀ w v : E, MemLp (fun x : E =>
p.derivative.eval ⟪w,x⟫_ℝ * ⟪v,x⟫_ℝ) 2 (stdGaussian E)) :
∃ D : E → E →L[ℝ] Lp ℝ 2 (stdGaussian E),
∀ w v, D w v = (hdf w v).toLp
(fun x : E => p.derivative.eval ⟪w,x⟫_ℝ * ⟪v,x⟫_ℝ) := by
classical
have hD (w : E) : ∃ D : E →L[ℝ] Lp ℝ 2 (stdGaussian E),
∀ v, D v = (hdf w v).toLp
(fun x : E => p.derivative.eval ⟪w,x⟫_ℝ * ⟪v,x⟫_ℝ) := by
let df := fun (v x : E) => p.derivative.eval ⟪w,x⟫_ℝ * ⟪v,x⟫_ℝ
let L : E →ₗ[ℝ] Lp ℝ 2 (stdGaussian E) := {
toFun := fun v => (hdf w v).toLp (df v)
map_add' := by
intro v u
apply Lp.ext
filter_upwards [(hdf w (v+u)).coeFn_toLp,
Lp.coeFn_add ((hdf w v).toLp (df v)) ((hdf w u).toLp (df u)),
(hdf w v).coeFn_toLp,(hdf w u).coeFn_toLp] with x hsum hadd hv hu
simp only [Pi.add_apply] at hadd
rw [hsum,hadd,hv,hu]
simp [df,inner_add_left,mul_add]
map_smul' := by
intro c v
apply Lp.ext
filter_upwards [(hdf w (c • v)).coeFn_toLp,
Lp.coeFn_smul c ((hdf w v).toLp (df v)),(hdf w v).coeFn_toLp] with x hcv hsmul hv
simp only [Pi.smul_apply,smul_eq_mul] at hsmul
simp only [RingHom.id_apply]
rw [hcv,hsmul,hv]
simp [df,real_inner_smul_left]
ring }
obtain ⟨B,hB,hB0,hBound⟩ :=
polynomial_radial_envelope (E := E) p.derivative ‖w‖ (norm_nonneg _) 1
let b := hB.toLp B
have hnorm (v : E) : ‖L v‖ ≤ ‖v‖ * ‖b‖ := by
apply Lp.norm_le_mul_norm_of_ae_le_mul
filter_upwards [(hdf w v).coeFn_toLp,hB.coeFn_toLp] with x hv hBx
change ‖(hdf w v).toLp (df v) x‖ ≤ ‖v‖ * ‖b x‖
rw [hv]
change ‖df v x‖ ≤ ‖v‖ * ‖hB.toLp B x‖
rw [hBx,Real.norm_of_nonneg (hB0 x)]
calc
‖df v x‖ = ‖p.derivative.eval ⟪w,x⟫_ℝ‖ * ‖⟪v,x⟫_ℝ‖ := norm_mul _ _
_ ≤ ‖p.derivative.eval ⟪w,x⟫_ℝ‖ * (‖v‖*‖x‖) :=
mul_le_mul_of_nonneg_left (norm_inner_le_norm (𝕜 := ℝ) v x) (norm_nonneg _)
_ = ‖v‖ * (‖p.derivative.eval ⟪w,x⟫_ℝ‖ * ‖x‖) := by ring
_ ≤ ‖v‖ * B x := mul_le_mul_of_nonneg_left
(by simpa using hBound w le_rfl x) (norm_nonneg _)
refine ⟨L.mkContinuous ‖b‖ (fun v => by simpa [mul_comm] using hnorm v),?_⟩
intro v
rfl
choose D hD using hD
exact ⟨D,hD⟩
Literal implementation excerpt from AutoSamplingTheory/TechnicalLemmas/Probability/GaussianPolynomialDifferentiation.lean. Local names retain their surrounding theorem context; the complete theorem and exact module context are folded below. These excerpts are presentation, not extra theorem premises.
3. Differentiate the pointwise polynomial
Polynomial differentiation composed with the inner-product functional yields the genuine scalar derivative for every x and every direction.
Corresponding Lean step
private theorem pointwise_ridge_hasFDerivAt
{E : Type*} [NormedAddCommGroup E] [InnerProductSpace ℝ E]
(p : Polynomial ℝ) (w x : E) :
HasFDerivAt (fun u : E => p.eval ⟪u,x⟫_ℝ)
(p.derivative.eval ⟪w,x⟫_ℝ • innerSL ℝ x) w := by
have h := (p.hasDerivAt ⟪x,w⟫_ℝ).comp_hasFDerivAt w (innerSL ℝ x).hasFDerivAt
simpa only [Function.comp_def,innerSL_apply_apply,real_inner_comm x] using h
Literal implementation excerpt from AutoSamplingTheory/TechnicalLemmas/Probability/GaussianPolynomialDifferentiation.lean. Local names retain their surrounding theorem context; the complete theorem and exact module context are folded below. These excerpts are presentation, not extra theorem premises.
4. Control the normalized remainder locally
A local scalar mean-value bound and the directional bound dominate the normalized scalar remainder by twice one L² envelope. At u=w define the inverse-norm normalization by the usual totalized value zero.
Corresponding Lean step
private theorem local_increment_bounds
{E : Type*} [NormedAddCommGroup E] [InnerProductSpace ℝ E]
[FiniteDimensional ℝ E] [MeasurableSpace E] [BorelSpace E]
(p : Polynomial ℝ) (w : E) :
∃ B : E → ℝ, MemLp B 2 (stdGaussian E) ∧ (∀ x, 0 ≤ B x) ∧
(∀ u : E, ‖u-w‖ ≤ 1 → ∀ x,
‖p.eval ⟪u,x⟫_ℝ - p.eval ⟪w,x⟫_ℝ‖ ≤ B x * ‖u-w‖) ∧
∀ (v x : E), ‖p.derivative.eval ⟪w,x⟫_ℝ * ⟪v,x⟫_ℝ‖ ≤ B x * ‖v‖ := by
obtain ⟨B,hB,hB0,hBound⟩ := polynomial_radial_envelope
(E := E) p.derivative (‖w‖+1) (by positivity) 1
have hwNorm : ‖w‖ ≤ ‖w‖+1 := by linarith
refine ⟨B,hB,hB0,?_,?_⟩
· intro u hu x
have huNorm : ‖u‖ ≤ ‖w‖+1 := by
calc
‖u‖ = ‖(u-w)+w‖ := by rw [sub_add_cancel]
_ ≤ ‖u-w‖+‖w‖ := norm_add_le _ _
_ ≤ ‖w‖+1 := by linarith
have hwMem : w ∈ Metric.closedBall (0 : E) (‖w‖+1) := by
simpa [Metric.mem_closedBall,dist_zero_right] using hwNorm
have huMem : u ∈ Metric.closedBall (0 : E) (‖w‖+1) := by
simpa [Metric.mem_closedBall,dist_zero_right] using huNorm
apply (convex_closedBall (0 : E) (‖w‖+1)).norm_image_sub_le_of_norm_hasFDerivWithin_le
(fun z hz => (pointwise_ridge_hasFDerivAt p z x).hasFDerivWithinAt) ?_ hwMem huMem
intro z hz
rw [norm_smul,innerSL_apply_norm]
have hzNorm : ‖z‖ ≤ ‖w‖+1 := by
simpa [Metric.mem_closedBall,dist_zero_right] using hz
simpa only [pow_one] using hBound z hzNorm x
· intro v x
calc
‖p.derivative.eval ⟪w,x⟫_ℝ * ⟪v,x⟫_ℝ‖ =
‖p.derivative.eval ⟪w,x⟫_ℝ‖ * ‖⟪v,x⟫_ℝ‖ := norm_mul _ _
_ ≤ ‖p.derivative.eval ⟪w,x⟫_ℝ‖ * (‖v‖*‖x‖) :=
mul_le_mul_of_nonneg_left (norm_inner_le_norm (𝕜 := ℝ) v x) (norm_nonneg _)
_ = (‖p.derivative.eval ⟪w,x⟫_ℝ‖ * ‖x‖) * ‖v‖ := by ring
_ ≤ B x * ‖v‖ := mul_le_mul_of_nonneg_right
(by simpa only [pow_one] using hBound w hwNorm x) (norm_nonneg _)
let r := fun (u x : E) => p.eval ⟪u,x⟫_ℝ - p.eval ⟪w,x⟫_ℝ -
p.derivative.eval ⟪w,x⟫_ℝ * ⟪u-w,x⟫_ℝ
let q := fun (u x : E) => ‖u-w‖⁻¹ * ‖r u x‖
obtain ⟨B,hB,hB0,hInc,hDir⟩ := local_increment_bounds p w
have hR (u : E) (hu : ‖u-w‖ ≤ 1) (x : E) :
‖r u x‖ ≤ (2 * B x) * ‖u-w‖ := by
exact (norm_sub_le _ _).trans ((add_le_add (hInc u hu x) (hDir (u-w) x)).trans_eq (by ring))
have hq (u : E) (hu : ‖u-w‖ ≤ 1) (x : E) : q u x ≤ 2 * B x := by
by_cases h : u = w
· subst u
simpa [q] using hB0 x
· have hn : 0 < ‖u-w‖ := norm_pos_iff.mpr (sub_ne_zero.mpr h)
calc
q u x ≤ ‖u-w‖⁻¹ * ((2 * B x) * ‖u-w‖) :=
mul_le_mul_of_nonneg_left (hR u hu x) (inv_nonneg.mpr (norm_nonneg _))
_ = 2 * B x := by field_simp
have hq0 (x : E) : q w x = 0 := by simp [q]
Literal implementation excerpt from AutoSamplingTheory/TechnicalLemmas/Probability/GaussianPolynomialDifferentiation.lean. Local names retain their surrounding theorem context; the complete theorem and exact module context are folded below. These excerpts are presentation, not extra theorem premises.
5. Use dominated convergence on the squared remainder
Pointwise Fréchet differentiability gives q_u(x)→0, and 4B² is integrable. Dominated convergence therefore controls the whole L² remainder, not just each fixed directional limit.
Corresponding Lean step
have hqcont (x : E) : ContinuousAt (fun u : E => q u x) w := by
rw [ContinuousAt,hq0]
have ht := (hasFDerivAt_iff_tendsto.mp (pointwise_ridge_hasFDerivAt p w x))
simpa only [q,r,ContinuousLinearMap.smul_apply,innerSL_apply_apply,
smul_eq_mul,real_inner_comm x] using ht
have hBsq : Integrable (fun x => 4 * (B x)^2) μ :=
((memLp_two_iff_integrable_sq hB.1).1 hB).const_mul 4
have hc : ContinuousAt (fun u : E => ∫ x, (q u x)^2 ∂μ) w := by
apply continuousAt_of_dominated (bound := fun x => 4 * (B x)^2)
· exact Eventually.of_forall fun u => by dsimp [q,r]; fun_prop
· filter_upwards [Metric.closedBall_mem_nhds w (by norm_num : (0:ℝ)<1)] with u hu
have hu' : ‖u-w‖ ≤ 1 := by simpa [Metric.mem_closedBall,dist_eq_norm] using hu
exact ae_of_all _ fun x => by
rw [Real.norm_eq_abs,abs_of_nonneg (sq_nonneg _)]
have hnon : 0 ≤ q u x := mul_nonneg (inv_nonneg.mpr (norm_nonneg _)) (norm_nonneg _)
have h := (sq_le_sq₀ hnon (mul_nonneg (by norm_num : (0:ℝ) ≤ 2) (hB0 x))).2 (hq u hu' x)
nlinarith
· exact hBsq
· exact ae_of_all _ fun x => (hqcont x).pow 2
Literal implementation excerpt from AutoSamplingTheory/TechnicalLemmas/Probability/GaussianPolynomialDifferentiation.lean. Local names retain their surrounding theorem context; the complete theorem and exact module context are folded below. These excerpts are presentation, not extra theorem premises.
6. Identify the actual quotient norm
Almost-everywhere identities for subtraction, scalar multiplication and toLp identify the displayed integral with the squared norm of the normalized genuine class remainder. Taking its square root proves the full ambient Fréchet limit.
Corresponding Lean step
let R := fun u : E => F u - F w - D w (u-w)
let G := fun u : E => ‖u-w‖⁻¹ • R u
have hnorm (u : E) : ‖G u‖^2 = ∫ x, (q u x)^2 ∂μ := by
rw [← real_inner_self_eq_norm_sq,L2.inner_def]
apply integral_congr_ae
have hd := (hdf w (u-w)).coeFn_toLp
rw [← hD w (u-w)] at hd
filter_upwards [Lp.coeFn_smul ‖u-w‖⁻¹ (R u),
Lp.coeFn_sub (F u - F w) (D w (u-w)),
Lp.coeFn_sub (F u) (F w),(hf u).coeFn_toLp,(hf w).coeFn_toLp,hd]
with x hsm hsub hsub' hfu hfw hdx
change inner ℝ (G u x) (G u x) = _
have hval : G u x = ‖u-w‖⁻¹ * r u x := by
change (‖u-w‖⁻¹ • R u) x = _
rw [hsm]
simp only [Pi.smul_apply,smul_eq_mul]
change ‖u-w‖⁻¹ * (F u - F w - D w (u-w)) x = _
rw [hsub]
simp only [Pi.sub_apply]
rw [hsub']
simp only [Pi.sub_apply]
change ‖u-w‖⁻¹ * ((hf u).toLp _ x - (hf w).toLp _ x - D w (u-w) x) = _
rw [hfu,hfw,hdx]
rw [hval]
simp [q,real_inner_self_eq_norm_sq,norm_mul,Real.norm_of_nonneg (inv_nonneg.mpr (norm_nonneg (u-w))),mul_pow]
have ht : Tendsto (fun u : E => ‖G u‖) (𝓝 w) (𝓝 0) := by
have hsq : ContinuousAt (fun u : E => ‖G u‖^2) w := by simpa only [← hnorm] using hc
have hz : G w = 0 := by simp [G]
have h := (Real.continuous_sqrt.continuousAt.comp hsq).tendsto
simpa only [Function.comp_def,Real.sqrt_sq (norm_nonneg _),hz,norm_zero,zero_pow (by decide : 2 ≠ 0),Real.sqrt_zero] using h
apply hasFDerivAt_iff_tendsto.mpr
simpa only [G,norm_smul,Real.norm_of_nonneg (inv_nonneg.mpr (norm_nonneg (_-w))),R,F] using ht
Literal implementation excerpt from AutoSamplingTheory/TechnicalLemmas/Probability/GaussianPolynomialDifferentiation.lean. Local names retain their surrounding theorem context; the complete theorem and exact module context are folded below. These excerpts are presentation, not extra theorem premises.
Lean verification
Lean proof · actual_gaussian_polynomial_ridge_L2_frechet_derivative
The displayed formula proof explains the mathematical route; the exact Lean is folded adjacent.
Braces mark parameters Lean can infer; square brackets request structures such as a measurable space or probability measure. Named hypotheses are mathematical premises, not facts established by this declaration. Section parameters are described in the mathematical hypotheses above; the module link retains their exact source context.
theorem actual_gaussian_polynomial_ridge_L2_frechet_derivative
{E : Type*} [NormedAddCommGroup E] [InnerProductSpace ℝ E]
[FiniteDimensional ℝ E] [MeasurableSpace E] [BorelSpace E]
(p : Polynomial ℝ) :
let γ := ProbabilityTheory.stdGaussian E
let f : E → E → ℝ := fun w x => p.eval ⟪w,x⟫_ℝ
let df : E → E → E → ℝ := fun w v x => p.derivative.eval ⟪w,x⟫_ℝ * ⟪v,x⟫_ℝ
∃ hf : ∀ w, MemLp (f w) 2 γ,
∃ hdf : ∀ w v, MemLp (df w v) 2 γ,
∃ D : E → E →L[ℝ] Lp ℝ 2 γ,
(∀ w v, D w v = (hdf w v).toLp (df w v)) ∧
∀ w, HasFDerivAt (fun u => (hf u).toLp (f u)) (D w) w := by
dsimp only
obtain ⟨hf,hdf⟩ := ambient_feature_and_derivative_memLp (E := E) p
obtain ⟨D,hD⟩ := represented_derivative_clm p hdf
exact ⟨hf,hdf,D,hD,fun w => actual_L2_hasFDerivAt p hf hdf D hD w⟩Scope and omitted-condition boundaries
- This is a full ambient derivative, not merely a derivative along the unit sphere or along one fixed direction.
- The theorem does not assert continuity of the derivative field, a second Fréchet derivative, a risk-potential identity or a manifold gradient.
Sources, dependencies, and reuse
Source and reuse
Samplinglib parents called
Mathlib API called (external library)
- Pinned Mathlib Gaussian norm moments and actual L² quotient calculus
Mathematical sources
- Samplinglib original feature differentiation and transport supplement v1 (2026-10-21) (historical source) — Original generic mathematical supplement from the cited pinned library prerequisites; no primary-textbook theorem or statistical convergence credit.
Samplinglib prose is not a quotation or a source-equivalence certificate. Definitions and aliases are explained as constructions, not counted as new mathematical proofs.