Uniform gradients of quadratic feature-law potentials
Mathematical statement
Let E be a finite-dimensional real inner-product normed space with its Borel measurable structure and H a complete real inner-product normed space. Let F:E→H have actual ambient Frechet derivative D(w):E→H for every w. Assume nonnegative M1,M2, an operator bound norm(D(w))≤M1 on the closed unit ball and an operator-Lipschitz bound norm(D(w)-D(u))≤M2 norm(w-u) there. Fix y in H. On the actual unit-norm subtype S define K(w)=F(w), angular cost c(u,v)=arccos(inner(u,v)), the actual Bochner mean m(mu)=integral K dmu, V_mu(w)=2 inner(m(mu)-y,F(w)), and G_mu(w)=2P_w D(w)^*(m(mu)-y) with the explicit projection P_w z=z−⟨z,w⟩w, which projects onto w-perpendicular when norm(w)=1. Let Q(mu,nu) be the literal extended nonnegative infimum of the quadratic angular cost over all actual couplings. There exist C1,C2>0, independent of probability laws and unit weights, such that for every actual parameter probability K is integrable, V_mu has the displayed ambient gradient 2D(w)^*(m(mu)-y) at every ambient w, and its projected G_mu is tangent and uniformly bounded by C1 at every unit weight. For every two actual parameter probabilities Q is finite and norm(G_mu(w)-G_nu(u))≤C2*(sqrt(Q).toReal+c(w,u)). Feature boundedness, strong measurability, feature Lipschitz control and residual budgets are derived inside the proof rather than assumed; the returned conclusions are feature integrability, actual ambient gradient, tangency/uniform bound, finite transport cost and the joint sensitivity estimate. The constants may depend on the displayed feature/derivative data, E,H and y. This is a generic feature-law theorem, not a concrete Gaussian scalar-data potential, installed manifold-gradient/Wasserstein API or intrinsic path-length theorem.
Lean statement · quadratic_feature_law_gradient_angular_transport_control
Let E be a finite-dimensional real inner-product normed space with its Borel measurable structure and H a complete real inner-product normed space. Let F:E→H have actual ambient Frechet derivative D(w):E→H for every w. Assume nonnegative M1,M2, an operator bound norm(D(w))<=M1 on the closed unit ball and an operator-Lipschitz bound norm(D(w)-D(u))<=M2 norm(w-u) there. Fix y in H. On the actual unit-norm subtype S define K(w)=F(w), angular cost c(u,v)=arccos(inner(u,v)), the actual Bochner mean m(mu)=integral K dmu, V_mu(w)=2 inner(m(mu)-y,F(w)), and G_mu(w)=2P_w D(w)^*(m(mu)-y) with the explicit projection P_w z=z−⟨z,w⟩w, which projects onto w-perpendicular when norm(w)=1. Let Q(mu,nu) be the literal extended nonnegative infimum of the quadratic angular cost over all actual couplings. There exist C1,C2>0, independent of probability laws and unit weights, such that for every actual parameter probability K is integrable, V_mu has the displayed ambient gradient 2D(w)^*(m(mu)-y) at every ambient w, and its projected G_mu is tangent and uniformly bounded by C1 at every unit weight. For every two actual parameter probabilities Q is finite and norm(G_mu(w)-G_nu(u))<=C2*(sqrt(Q).toReal+c(w,u)). Feature boundedness, strong measurability, feature Lipschitz control and residual budgets are derived inside the proof rather than assumed; the returned conclusions are feature integrability, actual ambient gradient, tangency/uniform bound, finite transport cost and the joint sensitivity estimate. The constants may depend on the displayed feature/derivative data, E,H and y. This is a generic feature-law theorem, not a concrete Gaussian scalar-data potential, installed manifold-gradient/Wasserstein API or intrinsic path-length theorem.
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 quadratic_feature_law_gradient_angular_transport_control
{E H : Type*} [NormedAddCommGroup E] [InnerProductSpace ℝ E]
[FiniteDimensional ℝ E] [MeasurableSpace E] [BorelSpace E]
[NormedAddCommGroup H] [InnerProductSpace ℝ H] [CompleteSpace H]
(F : E → H) (D : E → E →L[ℝ] H)
(hF : ∀ w, HasFDerivAt F (D w) w)
(M₁ M₂ : ℝ) (hM₁ : 0 ≤ M₁) (hM₂ : 0 ≤ M₂)
(hBound : ∀ w : E, ‖w‖ ≤ 1 → ‖D w‖ ≤ M₁)
(hLip : ∀ w u : E, ‖w‖ ≤ 1 → ‖u‖ ≤ 1 → ‖D w-D u‖ ≤ M₂*‖w-u‖)
(y : H) :
let S := {w : E // ‖w‖ = 1}
let K : S → H := fun w => F w.1
let c : S × S → ℝ := fun z => Real.arccos ⟪z.1.1,z.2.1⟫_ℝ
let m : Measure S → H := fun μ => ∫ w, K w ∂μ
let V : Measure S → E → ℝ := fun μ w => 2 * ⟪m μ-y,F w⟫_ℝ
let G : Measure S → E → E := fun μ w =>
(2 : ℝ) • ((D w).adjoint (m μ-y) - ⟪(D w).adjoint (m μ-y),w⟫_ℝ • w)
let Q : Measure S → Measure S → ℝ≥0∞ := fun μ ν =>
AutoSamplingTheory.TechnicalLemmas.Measure.Transport.transportCost
(fun z => ENNReal.ofReal ((c z)^2)) μ ν
∃ C₁ C₂ : ℝ, 0 < C₁ ∧ 0 < C₂ ∧
(∀ μ : Measure S, IsProbabilityMeasure μ →
Integrable K μ ∧
(∀ w : E, HasGradientAt (V μ) ((2 : ℝ) • (D w).adjoint (m μ-y)) w) ∧
∀ w : S, ⟪w.1,G μ w.1⟫_ℝ = 0 ∧ ‖G μ w.1‖ ≤ C₁) ∧
∀ μ ν : Measure S, IsProbabilityMeasure μ → IsProbabilityMeasure ν →
Q μ ν ≠ ∞ ∧ ∀ w u : S,
‖G μ w.1-G ν u.1‖ ≤
C₂ * ((Q μ ν ^ (1 / 2 : ℝ)).toReal + c (w,u))Read the complete mathematical statement and visible assumptions, then expand the numbered formula proof. Exact Lean remains optional and initially folded.
Full assumptions and notation
All objects and hypotheses
- E is finite-dimensional real Hilbert with Borel structure; H is a complete real inner-product normed space, with no separability assumption.
- F:E→H has actual full ambient Frechet derivative D(w) at every w. M1,M2≥0 bound the derivative operator norm and its operator Lipschitz increment on the closed unit ball.
- y is fixed. S is the literal unit-norm subtype; m is the actual Bochner integral, c the literal arccos cost, and Q the infimum of angular squared cost over all actual couplings.
Mathematical proof
1. Produce feature continuity and chord control
Differentiability gives continuity. The convex mean-value bound on the closed unit ball produces the M1 chord Lipschitz estimate. Continuity on a second-countable domain yields strong measurability of the feature restriction even when H is not separable.
Corresponding Lean step
have hFc : Continuous F := continuous_iff_continuousAt.mpr fun w => (hF w).continuousAt
have hKsm : StronglyMeasurable K := (hFc.comp continuous_subtype_val).stronglyMeasurable
have hChord (w u : E) (hw : ‖w‖ ≤ 1) (hu : ‖u‖ ≤ 1) :
‖F w-F u‖ ≤ M₁*‖w-u‖ := by
apply (convex_closedBall (0 : E) 1).norm_image_sub_le_of_norm_hasFDerivWithin_le
(fun z _ => (hF z).hasFDerivWithinAt) ?_
(by simpa [Metric.mem_closedBall,dist_zero_right] using hu)
(by simpa [Metric.mem_closedBall,dist_zero_right] using hw)
intro z hz
exact hBound z (by simpa [Metric.mem_closedBall,dist_zero_right] using hz)
Literal module excerpt. Local names retain the surrounding theorem context, available with the complete folded theorem; these are proof ingredients, not extra public premises.
2. Produce one uniform feature bound
Compare every unit feature with F(0), using the previous estimate and the norm triangle inequality. The extra one makes B a convenient positive budget. This budget is an internal consequence, not a new premise.
Corresponding Lean step
let B := ‖F (0:E)‖+M₁+1
have hB : 0 ≤ B := by dsimp [B]; positivity
have hKb (w : S) : ‖K w‖ ≤ B := by
have hb := hChord w.1 0 w.property.le (by simp)
have hn := norm_add_le (F w.1-F 0) (F 0)
rw [sub_add_cancel] at hn
simp only [sub_zero,w.property,mul_one] at hb
change ‖F w.1‖ ≤ B
dsimp [B]
linarith
Literal module excerpt. Local names retain the surrounding theorem context, available with the complete folded theorem; these are proof ingredients, not extra public premises.
3. Pass from chords to angular cost
The canonical angular-geometry result supplies measurability, nonnegativity, the pi upper bound and chord domination. Consequently K is M1 Lipschitz with respect to the actual angular cost.
Corresponding Lean step
have hAng := AutoSamplingTheory.TechnicalLemmas.Geometry.UnitSphereAngularCost.unit_sphere_angular_cost_properties (E := E)
change Continuous c ∧ Measurable c ∧
(∀ u v : S, 0 ≤ c (u,v) ∧ c (u,v) ≤ Real.pi ∧
c (u,v) = InnerProductGeometry.angle u.1 v.1 ∧ ‖u.1-v.1‖ ≤ c (u,v) ∧
(c (u,v) = 0 ↔ u = v) ∧ c (u,v) = c (v,u)) ∧
∀ u v w : S, c (u,w) ≤ c (u,v)+c (v,w) at hAng
have hc0 (z : S × S) : 0 ≤ c z := (hAng.2.2.1 z.1 z.2).1
have hcB (z : S × S) : c z ≤ Real.pi := (hAng.2.2.1 z.1 z.2).2.1
have hKlip (w u : S) : ‖K w-K u‖ ≤ M₁*c (w,u) :=
(hChord w.1 u.1 w.property.le u.property.le).trans
(mul_le_mul_of_nonneg_left (hAng.2.2.1 w u).2.2.2.1 hM₁)
Literal module excerpt. Local names retain the surrounding theorem context, available with the complete folded theorem; these are proof ingredients, not extra public premises.
4. Control actual means over all couplings
Apply bounded Bochner transport to actual probability laws, not chosen optimal couplings. It produces integrability, finite Q, the mean difference estimate and the residual budget R0=B+norm(y).
Corresponding Lean step
have hMean (μ ν : Measure S) [IsProbabilityMeasure μ] [IsProbabilityMeasure ν] :=
AutoSamplingTheory.TechnicalLemmas.Measure.BochnerMeanTransport.bounded_bochner_mean_quadratic_transport_control
K hKsm B Real.pi M₁ hB Real.pi_pos.le hM₁ hKb c hAng.2.1 hc0 hcB hKlip μ ν
have hTangent :=
AutoSamplingTheory.TechnicalLemmas.Geometry.QuadraticFeatureTangentGradient.quadratic_feature_potential_tangent_gradient
F D hF M₁ M₂ hM₁ hM₂ hBound hLip
let R₀ := B+‖y‖
have hR₀ : 0 ≤ R₀ := add_nonneg hB (norm_nonneg y)
have hResidual (μ : Measure S) [IsProbabilityMeasure μ] : ‖m μ-y‖ ≤ R₀ :=
((hMean μ μ).2.2.2.2 y).1
Literal module excerpt. Local names retain the surrounding theorem context, available with the complete folded theorem; these are proof ingredients, not extra public premises.
5. Identify the full ambient gradient
For fixed residual r=m_mu-y the canonical scalar-potential derivative is 2 inner(D(w)*r,·). The real Riesz identification turns it into HasGradientAt, at every ambient weight rather than only unit points.
Corresponding Lean step
have hGrad (μ : Measure S) (w : E) :
HasGradientAt (V μ) ((2 : ℝ) • (D w).adjoint (m μ-y)) w := by
rw [hasGradientAt_iff_hasFDerivAt]
have he : InnerProductSpace.toDual ℝ E ((2 : ℝ) • (D w).adjoint (m μ-y)) =
(2 : ℝ) • innerSL ℝ ((D w).adjoint (m μ-y)) := by
ext v
simp [InnerProductSpace.toDual_apply_apply,innerSL_apply_apply]
rw [he]
exact hTangent.1 (m μ-y) w
Literal module excerpt. Local names retain the surrounding theorem context, available with the complete folded theorem; these are proof ingredients, not extra public premises.
6. Choose constants before the laws
Projection contraction gives the pointwise bound, while R0 is independent of the parameter law. Choose strictly positive C1,C2 before quantifying over all laws and weights. The constants are not claimed dimension free.
Corresponding Lean step
let A := 2*M₁^2
let B₂ := 2*(M₂+2*M₁)*R₀
have hA : 0 ≤ A := by dsimp [A]; positivity
have hB₂ : 0 ≤ B₂ := by dsimp [B₂]; positivity
refine ⟨2*M₁*R₀+1,A+B₂+1,by positivity,by positivity,?_,?_⟩
· intro μ hμ
let : IsProbabilityMeasure μ := hμ
refine ⟨(hMean μ μ).1,hGrad μ,?_⟩
intro w
have ht := hTangent.2.1 (m μ-y) w.1 w.property
refine ⟨ht.1,?_⟩
exact ht.2.2.trans ((mul_le_mul_of_nonneg_left (hResidual μ) (by positivity)).trans (by linarith))
Literal module excerpt. Local names retain the surrounding theorem context, available with the complete folded theorem; these are proof ingredients, not extra public premises.
7. Combine law and point movement
Use the tangent-field joint estimate, substitute the actual mean sensitivity and residual budget, and dominate the chord by the angle. All costs are finite before applying toReal; the sum of the two coefficients plus one yields a single constant.
Corresponding Lean step
· intro μ ν hμ hν
let : IsProbabilityMeasure μ := hμ
let : IsProbabilityMeasure ν := hν
refine ⟨(hMean μ ν).2.2.1,?_⟩
intro w u
have hm : ‖(m μ-y)-(m ν-y)‖ ≤ M₁*(Q μ ν ^ (1 / 2 : ℝ)).toReal := by
simpa only [sub_sub_sub_cancel_right] using (hMean μ ν).2.2.2.1
have hr := hResidual ν
have ht := hTangent.2.2 (m μ-y) (m ν-y) w.1 u.1 w.property u.property
have hpoint := (hAng.2.2.1 w u).2.2.2.1
have ht' : ‖G μ w.1-G ν u.1‖ ≤
A*(Q μ ν ^ (1 / 2 : ℝ)).toReal+B₂*c (w,u) := by
calc
_ ≤ 2*M₁*‖(m μ-y)-(m ν-y)‖+
2*(M₂+2*M₁)*‖m ν-y‖*‖w.1-u.1‖ := ht
_ ≤ 2*M₁*(M₁*(Q μ ν ^ (1 / 2 : ℝ)).toReal)+
2*(M₂+2*M₁)*R₀*c (w,u) := by
gcongr
_ = _ := by dsimp [A,B₂]; ring
apply ht'.trans
have hs : 0 ≤ (Q μ ν ^ (1 / 2 : ℝ)).toReal := ENNReal.toReal_nonneg
have hc := hc0 (w,u)
nlinarith [mul_nonneg hA hc,mul_nonneg hB₂ hs]
Literal module excerpt. Local names retain the surrounding theorem context, available with the complete folded theorem; these are proof ingredients, not extra public premises.
Lean verification
Lean proof · quadratic_feature_law_gradient_angular_transport_control
The formula steps explain the proof; optional folds contain literal Lean excerpts and the full checked theorem.
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 quadratic_feature_law_gradient_angular_transport_control
{E H : Type*} [NormedAddCommGroup E] [InnerProductSpace ℝ E]
[FiniteDimensional ℝ E] [MeasurableSpace E] [BorelSpace E]
[NormedAddCommGroup H] [InnerProductSpace ℝ H] [CompleteSpace H]
(F : E → H) (D : E → E →L[ℝ] H)
(hF : ∀ w, HasFDerivAt F (D w) w)
(M₁ M₂ : ℝ) (hM₁ : 0 ≤ M₁) (hM₂ : 0 ≤ M₂)
(hBound : ∀ w : E, ‖w‖ ≤ 1 → ‖D w‖ ≤ M₁)
(hLip : ∀ w u : E, ‖w‖ ≤ 1 → ‖u‖ ≤ 1 → ‖D w-D u‖ ≤ M₂*‖w-u‖)
(y : H) :
let S := {w : E // ‖w‖ = 1}
let K : S → H := fun w => F w.1
let c : S × S → ℝ := fun z => Real.arccos ⟪z.1.1,z.2.1⟫_ℝ
let m : Measure S → H := fun μ => ∫ w, K w ∂μ
let V : Measure S → E → ℝ := fun μ w => 2 * ⟪m μ-y,F w⟫_ℝ
let G : Measure S → E → E := fun μ w =>
(2 : ℝ) • ((D w).adjoint (m μ-y) - ⟪(D w).adjoint (m μ-y),w⟫_ℝ • w)
let Q : Measure S → Measure S → ℝ≥0∞ := fun μ ν =>
AutoSamplingTheory.TechnicalLemmas.Measure.Transport.transportCost
(fun z => ENNReal.ofReal ((c z)^2)) μ ν
∃ C₁ C₂ : ℝ, 0 < C₁ ∧ 0 < C₂ ∧
(∀ μ : Measure S, IsProbabilityMeasure μ →
Integrable K μ ∧
(∀ w : E, HasGradientAt (V μ) ((2 : ℝ) • (D w).adjoint (m μ-y)) w) ∧
∀ w : S, ⟪w.1,G μ w.1⟫_ℝ = 0 ∧ ‖G μ w.1‖ ≤ C₁) ∧
∀ μ ν : Measure S, IsProbabilityMeasure μ → IsProbabilityMeasure ν →
Q μ ν ≠ ∞ ∧ ∀ w u : S,
‖G μ w.1-G ν u.1‖ ≤
C₂ * ((Q μ ν ^ (1 / 2 : ℝ)).toReal + c (w,u)) := by
let : SecondCountableTopology E := inferInstance
let S := {w : E // ‖w‖ = 1}
let K : S → H := fun w => F w.1
let c : S × S → ℝ := fun z => Real.arccos ⟪z.1.1,z.2.1⟫_ℝ
let m : Measure S → H := fun μ => ∫ w, K w ∂μ
let V : Measure S → E → ℝ := fun μ w => 2 * ⟪m μ-y,F w⟫_ℝ
let G : Measure S → E → E := fun μ w =>
(2 : ℝ) • ((D w).adjoint (m μ-y) - ⟪(D w).adjoint (m μ-y),w⟫_ℝ • w)
let Q : Measure S → Measure S → ℝ≥0∞ := fun μ ν =>
AutoSamplingTheory.TechnicalLemmas.Measure.Transport.transportCost
(fun z => ENNReal.ofReal ((c z)^2)) μ ν
change ∃ C₁ C₂ : ℝ, 0 < C₁ ∧ 0 < C₂ ∧
(∀ μ : Measure S, IsProbabilityMeasure μ →
Integrable K μ ∧
(∀ w : E, HasGradientAt (V μ) ((2 : ℝ) • (D w).adjoint (m μ-y)) w) ∧
∀ w : S, ⟪w.1,G μ w.1⟫_ℝ = 0 ∧ ‖G μ w.1‖ ≤ C₁) ∧
∀ μ ν : Measure S, IsProbabilityMeasure μ → IsProbabilityMeasure ν →
Q μ ν ≠ ∞ ∧ ∀ w u : S,
‖G μ w.1-G ν u.1‖ ≤ C₂ * ((Q μ ν ^ (1 / 2 : ℝ)).toReal + c (w,u))
have hFc : Continuous F := continuous_iff_continuousAt.mpr fun w => (hF w).continuousAt
have hKsm : StronglyMeasurable K := (hFc.comp continuous_subtype_val).stronglyMeasurable
have hChord (w u : E) (hw : ‖w‖ ≤ 1) (hu : ‖u‖ ≤ 1) :
‖F w-F u‖ ≤ M₁*‖w-u‖ := by
apply (convex_closedBall (0 : E) 1).norm_image_sub_le_of_norm_hasFDerivWithin_le
(fun z _ => (hF z).hasFDerivWithinAt) ?_
(by simpa [Metric.mem_closedBall,dist_zero_right] using hu)
(by simpa [Metric.mem_closedBall,dist_zero_right] using hw)
intro z hz
exact hBound z (by simpa [Metric.mem_closedBall,dist_zero_right] using hz)
let B := ‖F (0:E)‖+M₁+1
have hB : 0 ≤ B := by dsimp [B]; positivity
have hKb (w : S) : ‖K w‖ ≤ B := by
have hb := hChord w.1 0 w.property.le (by simp)
have hn := norm_add_le (F w.1-F 0) (F 0)
rw [sub_add_cancel] at hn
simp only [sub_zero,w.property,mul_one] at hb
change ‖F w.1‖ ≤ B
dsimp [B]
linarith
have hAng := AutoSamplingTheory.TechnicalLemmas.Geometry.UnitSphereAngularCost.unit_sphere_angular_cost_properties (E := E)
change Continuous c ∧ Measurable c ∧
(∀ u v : S, 0 ≤ c (u,v) ∧ c (u,v) ≤ Real.pi ∧
c (u,v) = InnerProductGeometry.angle u.1 v.1 ∧ ‖u.1-v.1‖ ≤ c (u,v) ∧
(c (u,v) = 0 ↔ u = v) ∧ c (u,v) = c (v,u)) ∧
∀ u v w : S, c (u,w) ≤ c (u,v)+c (v,w) at hAng
have hc0 (z : S × S) : 0 ≤ c z := (hAng.2.2.1 z.1 z.2).1
have hcB (z : S × S) : c z ≤ Real.pi := (hAng.2.2.1 z.1 z.2).2.1
have hKlip (w u : S) : ‖K w-K u‖ ≤ M₁*c (w,u) :=
(hChord w.1 u.1 w.property.le u.property.le).trans
(mul_le_mul_of_nonneg_left (hAng.2.2.1 w u).2.2.2.1 hM₁)
have hMean (μ ν : Measure S) [IsProbabilityMeasure μ] [IsProbabilityMeasure ν] :=
AutoSamplingTheory.TechnicalLemmas.Measure.BochnerMeanTransport.bounded_bochner_mean_quadratic_transport_control
K hKsm B Real.pi M₁ hB Real.pi_pos.le hM₁ hKb c hAng.2.1 hc0 hcB hKlip μ ν
have hTangent :=
AutoSamplingTheory.TechnicalLemmas.Geometry.QuadraticFeatureTangentGradient.quadratic_feature_potential_tangent_gradient
F D hF M₁ M₂ hM₁ hM₂ hBound hLip
let R₀ := B+‖y‖
have hR₀ : 0 ≤ R₀ := add_nonneg hB (norm_nonneg y)
have hResidual (μ : Measure S) [IsProbabilityMeasure μ] : ‖m μ-y‖ ≤ R₀ :=
((hMean μ μ).2.2.2.2 y).1
have hGrad (μ : Measure S) (w : E) :
HasGradientAt (V μ) ((2 : ℝ) • (D w).adjoint (m μ-y)) w := by
rw [hasGradientAt_iff_hasFDerivAt]
have he : InnerProductSpace.toDual ℝ E ((2 : ℝ) • (D w).adjoint (m μ-y)) =
(2 : ℝ) • innerSL ℝ ((D w).adjoint (m μ-y)) := by
ext v
simp [InnerProductSpace.toDual_apply_apply,innerSL_apply_apply]
rw [he]
exact hTangent.1 (m μ-y) w
let A := 2*M₁^2
let B₂ := 2*(M₂+2*M₁)*R₀
have hA : 0 ≤ A := by dsimp [A]; positivity
have hB₂ : 0 ≤ B₂ := by dsimp [B₂]; positivity
refine ⟨2*M₁*R₀+1,A+B₂+1,by positivity,by positivity,?_,?_⟩
· intro μ hμ
let : IsProbabilityMeasure μ := hμ
refine ⟨(hMean μ μ).1,hGrad μ,?_⟩
intro w
have ht := hTangent.2.1 (m μ-y) w.1 w.property
refine ⟨ht.1,?_⟩
exact ht.2.2.trans ((mul_le_mul_of_nonneg_left (hResidual μ) (by positivity)).trans (by linarith))
· intro μ ν hμ hν
let : IsProbabilityMeasure μ := hμ
let : IsProbabilityMeasure ν := hν
refine ⟨(hMean μ ν).2.2.1,?_⟩
intro w u
have hm : ‖(m μ-y)-(m ν-y)‖ ≤ M₁*(Q μ ν ^ (1 / 2 : ℝ)).toReal := by
simpa only [sub_sub_sub_cancel_right] using (hMean μ ν).2.2.2.1
have hr := hResidual ν
have ht := hTangent.2.2 (m μ-y) (m ν-y) w.1 u.1 w.property u.property
have hpoint := (hAng.2.2.1 w u).2.2.2.1
have ht' : ‖G μ w.1-G ν u.1‖ ≤
A*(Q μ ν ^ (1 / 2 : ℝ)).toReal+B₂*c (w,u) := by
calc
_ ≤ 2*M₁*‖(m μ-y)-(m ν-y)‖+
2*(M₂+2*M₁)*‖m ν-y‖*‖w.1-u.1‖ := ht
_ ≤ 2*M₁*(M₁*(Q μ ν ^ (1 / 2 : ℝ)).toReal)+
2*(M₂+2*M₁)*R₀*c (w,u) := by
gcongr
_ = _ := by dsimp [A,B₂]; ring
apply ht'.trans
have hs : 0 ≤ (Q μ ν ^ (1 / 2 : ℝ)).toReal := ENNReal.toReal_nonneg
have hc := hc0 (w,u)
nlinarith [mul_nonneg hA hc,mul_nonneg hB₂ hs]
end AutoSamplingTheory.TechnicalLemmas.Geometry.QuadraticFeatureLawGradientScope and omitted-condition boundaries
- F and D plus their actual derivative/operator bounds remain explicit generic inputs. A specific model must produce them and identify its literal scalar potential with this Hilbert potential.
- Angular all-coupling cost, tangent projection and actual ambient gradient are explicit. Identification with a chosen Riemannian-gradient/Wasserstein API or intrinsic path-length convention remains separate.
- Auxiliary feature bounds, strong measurability and residual estimates are derived internally; they are not separately returned conjuncts. Constants may depend on E,H,F,D,M1,M2,y.
Sources, dependencies, and reuse
Source and reuse
Samplinglib parents called
AutoSamplingTheory.TechnicalLemmas.Geometry.UnitSphereAngularCost.unit_sphere_angular_cost_propertiesAutoSamplingTheory.TechnicalLemmas.Geometry.QuadraticFeatureTangentGradient.quadratic_feature_potential_tangent_gradientAutoSamplingTheory.TechnicalLemmas.Measure.BochnerMeanTransport.bounded_bochner_mean_quadratic_transport_control
Mathlib API called (external library)
- Convex.norm_image_sub_le_of_norm_hasFDerivWithin_le
- Continuous.stronglyMeasurable
- hasGradientAt_iff_hasFDerivAt
- InnerProductSpace.toDual_apply_apply
Mathematical sources
- Samplinglib original sphere geometry and feature-law supplement v1 (2026-10-23) (historical source) — Original generic canonical-library mathematics placed by subject; no primary-textbook theorem, concrete statistical model or whole chapter 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.