8.6. Manuscript Section 6
8.6.1. Definition 6.1 — Activation-dependent Rademacher complexity (def:rademacher-complexity)
Blueprint node: Definition 5.1.1. Status: defined (definitions only, nothing for comparator to check).
Formalization note. The sample space of N i.i.d. parameters is Fin N → H × ℝ with the product measure sampleLaw N p = Measure.pi (fun _ => p); Rademacher signs are real coordinates ε : Fin N → ℝ with the law rademacherMeasure N = Measure.pi of (δ_{-1} + δ_1)/2; 𝔑_N(K;p,β) = rademacherComplexity N K p β h is the Bochner integral over the product law of sup_{x∈K} ‖N⁻¹ Σ ε_j β(⟨a_j,x⟩+c_j) h(θ_j)‖, polymorphic in the output space (Y-valued h gives 𝔑^Y_N). The polar decomposition Γ = h|Γ| of a VectorMeasure of finite variation is polarDensity Γ = h (a density of Γ w.r.t. Γ.variation with ‖h‖ = 1 a.e., chosen when one exists, junk 0 otherwise), polarWeight Γ = V = ‖Γ‖_TV, polarLaw Γ = p = |Γ|/V (the zero measure when Γ = 0, the manuscript's zero network). The sampled network eq:polar-network is sampledNetwork β V h θ = finiteNetwork with outer weights (V/N) h(θ_j). ‖·‖_{C(K)} is compactSupNorm K f = sSup ((‖f ·‖) '' K).
OperatorRidgelet.compactSupNorm: definition in the library (def in OperatorRidgelet/Sampling/Defs.lean); see the Lean panel of the Blueprint node above.
OperatorRidgelet.polarDensity: definition in the library (def in OperatorRidgelet/Sampling/Defs.lean); see the Lean panel of the Blueprint node above.
OperatorRidgelet.polarWeight: definition in the library (def in OperatorRidgelet/Sampling/Defs.lean); see the Lean panel of the Blueprint node above.
OperatorRidgelet.polarLaw: definition in the library (def in OperatorRidgelet/Sampling/Defs.lean); see the Lean panel of the Blueprint node above.
OperatorRidgelet.sampleLaw: definition in the library (def in OperatorRidgelet/Sampling/Defs.lean); see the Lean panel of the Blueprint node above.
OperatorRidgelet.rademacherMeasure: definition in the library (def in OperatorRidgelet/Sampling/Defs.lean); see the Lean panel of the Blueprint node above.
OperatorRidgelet.sampledNetwork: definition in the library (def in OperatorRidgelet/Sampling/Defs.lean); see the Lean panel of the Blueprint node above.
OperatorRidgelet.rademacherComplexity: definition in the library (def in OperatorRidgelet/Sampling/Defs.lean); see the Lean panel of the Blueprint node above.
8.6.2. Theorem 6.2 — General compact-open sampling bound (thm:general-rademacher)
Blueprint node: Theorem 5.1.4. Status: verified (its Lean theorem is verified).
Formalization note. 'The atoms are measurable and integrably bounded in C(K)' is encoded as a Bochner-integrable map Φ : H × ℝ → (K →ᵇ ℂ) (BoundedContinuousFunction on the subtype K) with respect to p whose values are the atoms h(θ)β(⟨a,·⟩+c) on K. Expectation is the Bochner integral over sampleLaw N (polarLaw Γ) of compactSupNorm K (f_N θ − S_β Γ); N > 0 is assumed (the bound is void for N = 0). The theorem is stated with f = integralNetwork β Γ, which is the vector-measure integral (0 if the integrand is not integrable) — under the hypothesis it is the Bochner integral.
OperatorRidgelet.Paper.thm_general_rademacher, theorem in Challenge/Sampling.lean:
/-- **Theorem [thm:general-rademacher]** General compact-open sampling bound. Whenever the
atoms `x ↦ h(θ) β(⟪a, x⟫ + c)` are measurable and integrably bounded in `C(K)` (they are the
values of a Bochner-integrable map `Φ : Θ → C(K)`), the sampled network of the polar
decomposition of `Γ` satisfies `𝔼‖f_N − f‖_{C(K)} ≤ 2V 𝔑_N(K; p, β)`. -/
theorem thm_general_rademacher [MeasurableSpace H] [BorelSpace H] (β : ℝ → ℂ)
(Γ : ComplexMeasure (H × ℝ)) [IsFiniteMeasure Γ.variation] {K : Set H} (hK : IsCompact K)
(Φ : H × ℝ → (K →ᵇ ℂ))
(hΦ : ∀ θ : H × ℝ, ∀ x : K, Φ θ x = β (⟪θ.1, (x : H)⟫ + θ.2) * polarDensity Γ θ)
(hint : Integrable Φ (polarLaw Γ)) {N : ℕ} (hN : 0 < N) :
∫ θ, compactSupNorm K (fun x => polarSampledNetwork β Γ θ x - integralNetwork β Γ x)
∂sampleLaw N (polarLaw Γ) ≤
2 * polarWeight Γ * rademacherComplexity N K (polarLaw Γ) β (polarDensity Γ) := by
Status: verified by comparator.
8.6.3. Theorem 6.3 — Dimension-free uniform Hilbert-valued Barron bound (thm:lipschitz-barron)
Blueprint node: Theorem 5.1.6. Status: verified (all 3 Lean theorems verified).
Formalization note. Real β with LipschitzWith L β; Lip(β) is any such L (equivalent to the least constant). Γ is a Y-valued measure of finite variation for a separable complex Hilbert space Y (the scalar case is Y = ℂ). M₂² < ∞ is Integrable (‖a‖² + |c|²) (polarLaw Γ), and M₂ = √(secondMoment (polarLaw Γ)); R_K = compactRadius K = sSup of √(‖x‖²+1) over K. Part i is the expectation bound V(4|β(0)| + 8 Lip(β) R_K M₂)/√N over sampleLaw N (polarLaw Γ) with N > 0; part ii the existence of a deterministic sample θ : Fin N → H × ℝ with the same bound; part iii the weaker second inequality 8V(|β(0)| + Lip(β) R_K M₂)/√N. Γ = 0 and K = ∅ are allowed (all quantities vanish), which is the manuscript's convention for V = 0 and for the empty compact set. The proof replaces the contraction principle by lem:two-coordinate-comparison; the scalar bound used by the corollaries is the library lemma OperatorRidgelet.integral_compactSupNorm_polarSampledNetwork_sub_le.
OperatorRidgelet.Paper.thm_lipschitz_barron_i, theorem in Challenge/Sampling.lean:
/-- **Theorem [thm:lipschitz-barron]** Dimension-free uniform Hilbert-valued Barron bound. For a
finite-variation `Y`-valued measure `Γ = h|Γ|` with `V = ‖Γ‖_TV` and `p = |Γ|/V`, a real
globally Lipschitz `β`, and `M₂² = ∫ (‖a‖² + |c|²) dp < ∞`, the sampled network
`eq:polar-network` with `Y`-valued weights satisfies
`𝔼‖f_N − f‖_{C(K;Y)} ≤ (V/√N)(4|β(0)| + 8 Lip(β) R_K M₂)`. The manuscript's conventions
`V = 0` (the zero network) and `K = ∅` (zero error) are instances of the statement. -/
theorem thm_lipschitz_barron_i {Y : Type*} [NormedAddCommGroup Y] [InnerProductSpace ℂ Y]
[CompleteSpace Y] [SecondCountableTopology Y] [MeasurableSpace H] [BorelSpace H]
[SecondCountableTopology H] {β : ℝ → ℝ} {L : ℝ≥0}
(hβ : LipschitzWith L β) (Γ : VectorMeasure (H × ℝ) Y) [IsFiniteMeasure Γ.variation]
(hM : Integrable (fun θ : H × ℝ => ‖θ.1‖ ^ 2 + |θ.2| ^ 2) (polarLaw Γ)) {K : Set H}
(hK : IsCompact K) {N : ℕ} (hN : 0 < N) :
∫ θ, compactSupNorm K (fun x =>
polarSampledNetwork (fun t => (β t : ℂ)) Γ θ x -
integralNetwork (fun t => (β t : ℂ)) Γ x)
∂sampleLaw N (polarLaw Γ) ≤
polarWeight Γ / Real.sqrt N *
(4 * |β 0| + 8 * (L : ℝ) * compactRadius K *
Real.sqrt (secondMoment (polarLaw Γ))) := by
Status: verified by comparator.
OperatorRidgelet.Paper.thm_lipschitz_barron_ii, theorem in Challenge/Sampling.lean:
/-- **Theorem [thm:lipschitz-barron]** Dimension-free uniform Hilbert-valued Barron bound. At
least one deterministic width-`N` realization satisfies the same bound
`‖f_N − f‖_{C(K;Y)} ≤ (V/√N)(4|β(0)| + 8 Lip(β) R_K M₂)`. -/
theorem thm_lipschitz_barron_ii {Y : Type*} [NormedAddCommGroup Y] [InnerProductSpace ℂ Y]
[CompleteSpace Y] [SecondCountableTopology Y] [MeasurableSpace H] [BorelSpace H]
[SecondCountableTopology H] {β : ℝ → ℝ} {L : ℝ≥0}
(hβ : LipschitzWith L β) (Γ : VectorMeasure (H × ℝ) Y) [IsFiniteMeasure Γ.variation]
(hM : Integrable (fun θ : H × ℝ => ‖θ.1‖ ^ 2 + |θ.2| ^ 2) (polarLaw Γ)) {K : Set H}
(hK : IsCompact K) {N : ℕ} (hN : 0 < N) :
∃ θ : Fin N → H × ℝ,
compactSupNorm K (fun x =>
polarSampledNetwork (fun t => (β t : ℂ)) Γ θ x -
integralNetwork (fun t => (β t : ℂ)) Γ x) ≤
polarWeight Γ / Real.sqrt N *
(4 * |β 0| + 8 * (L : ℝ) * compactRadius K *
Real.sqrt (secondMoment (polarLaw Γ))) := by
Status: verified by comparator.
OperatorRidgelet.Paper.thm_lipschitz_barron_iii, theorem in Challenge/Sampling.lean:
/-- **Theorem [thm:lipschitz-barron]** Dimension-free uniform Hilbert-valued Barron bound, in the
weaker form `𝔼‖f_N − f‖_{C(K;Y)} ≤ (8V/√N)(|β(0)| + Lip(β) R_K M₂)` of the second displayed
inequality. -/
theorem thm_lipschitz_barron_iii {Y : Type*} [NormedAddCommGroup Y] [InnerProductSpace ℂ Y]
[CompleteSpace Y] [SecondCountableTopology Y] [MeasurableSpace H] [BorelSpace H]
[SecondCountableTopology H] {β : ℝ → ℝ} {L : ℝ≥0}
(hβ : LipschitzWith L β) (Γ : VectorMeasure (H × ℝ) Y) [IsFiniteMeasure Γ.variation]
(hM : Integrable (fun θ : H × ℝ => ‖θ.1‖ ^ 2 + |θ.2| ^ 2) (polarLaw Γ)) {K : Set H}
(hK : IsCompact K) {N : ℕ} (hN : 0 < N) :
∫ θ, compactSupNorm K (fun x =>
polarSampledNetwork (fun t => (β t : ℂ)) Γ θ x -
integralNetwork (fun t => (β t : ℂ)) Γ x)
∂sampleLaw N (polarLaw Γ) ≤
8 * polarWeight Γ / Real.sqrt N *
(|β 0| + (L : ℝ) * compactRadius K * Real.sqrt (secondMoment (polarLaw Γ))) := by
Status: verified by comparator.
8.6.4. Theorem 6.4 — Finite variation and moments of the coefficient (thm:E)
Blueprint node: Theorem 5.2.1. Status: verified (all 5 Lean theorems verified).
Formalization note. Stated for the abstract direction measure ν (σ-finite, full support, homogeneous of degree α) with an explicit frequency window I of ρ (IsFrequencyWindow ρ I), as thm:A. Part i: ∃ c < ∞ (depending on ρ, α, I) such that for all G regular along rays the lintegral ∫⁻ (1+‖a‖²+|c|²) ‖γ_G‖ₑ dλ_α ≤ c · rayMoment ν I G 4, with γ_G = coefficientFormula ρ G; part ii the finiteness '< ∞' as Bochner integrability. Parts iii and iv take the tempered β as the pair (β, b) with IsTemperedFunction β b, LipschitzWith L b, ¬IsPolynomialFun b: iii is C^{(α)}_{β,ρ} g_G = integralNetworkDensity b λ_α γ_G pointwise, iv the 8V/√N bound with V = densityWeight λ_α γ_G = ‖γ_G‖_{L¹}, p = densityLaw λ_α γ_G = |γ_G|λ_α/V, h = densityPhase γ_G = γ_G/|γ_G|, for every compact K and N > 0.
OperatorRidgelet.Paper.thm_E_i, theorem in Challenge/Sampling.lean:
/-- **Theorem [thm:E]** Finite variation and moments of the coefficient. For a band-pass `ρ`
with frequency window `I` there is a finite constant `c_ρ`, depending only on `ρ` and `α`,
such that every `G` regular along rays satisfies
`∫ (1 + ‖a‖² + |c|²) |γ_G| dλ_α ≤ c_ρ M₄(G)`. -/
theorem thm_E_i (ν : Measure H) [SigmaFinite ν] [ν.IsOpenPosMeasure] {α : ℝ} (hα : 0 < α)
(hν : IsHomogeneous α ν) (ρ : SchwartzMap ℝ ℝ) (hρ : IsBandPass ρ) (I : Set ℝ)
(hI : IsFrequencyWindow ρ I) :
∃ c : ℝ≥0∞, c ≠ ⊤ ∧ ∀ G : H → ℂ, IsRegularAlongRays ν I G →
∫⁻ θ, ENNReal.ofReal (1 + ‖θ.1‖ ^ 2 + |θ.2| ^ 2) * ‖coefficientFormula ρ G θ‖ₑ
∂parameterMeasure ν ≤
c * rayMoment ν I G 4 := by
Status: verified by comparator.
OperatorRidgelet.Paper.thm_E_ii, theorem in Challenge/Sampling.lean:
/-- **Theorem [thm:E]** Finite variation and moments of the coefficient. For `G` regular along
rays, `∫ (1 + ‖a‖² + |c|²) |γ_G| dλ_α < ∞`: the coefficient measure `γ_G λ_α` is finite with
finite second moment. -/
theorem thm_E_ii (ν : Measure H) [SigmaFinite ν] [ν.IsOpenPosMeasure] {α : ℝ} (hα : 0 < α)
(hν : IsHomogeneous α ν) (ρ : SchwartzMap ℝ ℝ) (hρ : IsBandPass ρ) (I : Set ℝ)
(hI : IsFrequencyWindow ρ I) (G : H → ℂ) (hG : IsRegularAlongRays ν I G) :
Integrable (fun θ : H × ℝ => (1 + ‖θ.1‖ ^ 2 + |θ.2| ^ 2) * ‖coefficientFormula ρ G θ‖)
(parameterMeasure ν) := by
Status: verified by comparator.
OperatorRidgelet.Paper.thm_E_iii, theorem in Challenge/Sampling.lean:
/-- **Theorem [thm:E]** Finite variation and moments of the coefficient. Consequently, for every
real `β` that is globally Lipschitz (a tempered activation that is the
function `b`), the target `C^{(α)}_{β,ρ} g_G` is the integral network `S_β[γ_G λ_α]`. -/
theorem thm_E_iii (ν : Measure H) [SigmaFinite ν] [ν.IsOpenPosMeasure] {α : ℝ} (hα : 0 < α)
(hν : IsHomogeneous α ν) (ρ : SchwartzMap ℝ ℝ) (hρ : IsBandPass ρ) (I : Set ℝ)
(hI : IsFrequencyWindow ρ I) (β : TemperedDistribution ℝ ℂ) (b : ℝ → ℝ)
(hβ : IsTemperedFunction β b) {L : ℝ≥0} (hb : LipschitzWith L b)
(G : H → ℂ) (hG : IsRegularAlongRays ν I G) :
∀ x : H, temperedAdmissibilityConst α β ρ * spectralTarget ν G x =
integralNetworkDensity (fun t => (b t : ℂ)) (parameterMeasure ν) (coefficientFormula ρ G)
x := by
Status: verified by comparator.
OperatorRidgelet.Paper.thm_E_iv, theorem in Challenge/Sampling.lean:
/-- **Theorem [thm:E]** Finite variation and moments of the coefficient. For real globally
Lipschitz `β`, the sampled network `eq:polar-network` of `γ_G λ_α`, with
`V = ‖γ_G‖_{L¹(λ_α)}` and `M₂` the second moment of `p = |γ_G| λ_α / V`, satisfies
`𝔼‖f_N − C^{(α)}_{β,ρ} g_G‖_{C(K)} ≤ (8V/√N)(|β(0)| + Lip(β) R_K M₂)` for every compact
`K`. -/
theorem thm_E_iv (ν : Measure H) [SigmaFinite ν] [ν.IsOpenPosMeasure] {α : ℝ} (hα : 0 < α)
(hν : IsHomogeneous α ν) (ρ : SchwartzMap ℝ ℝ) (hρ : IsBandPass ρ) (I : Set ℝ)
(hI : IsFrequencyWindow ρ I) (β : TemperedDistribution ℝ ℂ) (b : ℝ → ℝ)
(hβ : IsTemperedFunction β b) {L : ℝ≥0} (hb : LipschitzWith L b)
(G : H → ℂ) (hG : IsRegularAlongRays ν I G) {K : Set H}
(hK : IsCompact K) {N : ℕ} (hN : 0 < N) :
∫ θ, compactSupNorm K (fun x =>
densitySampledNetwork (fun t => (b t : ℂ)) (parameterMeasure ν)
(coefficientFormula ρ G) θ x -
temperedAdmissibilityConst α β ρ * spectralTarget ν G x)
∂sampleLaw N (densityLaw (parameterMeasure ν) (coefficientFormula ρ G)) ≤
8 * densityWeight (parameterMeasure ν) (coefficientFormula ρ G) / Real.sqrt N *
(|b 0| + (L : ℝ) * compactRadius K *
Real.sqrt (secondMoment (densityLaw (parameterMeasure ν) (coefficientFormula ρ G)))) := by
Status: verified by comparator.
OperatorRidgelet.Paper.thm_E_moments, theorem in Challenge/Revision.lean:
omit [CompleteSpace H] [SecondCountableTopology H] [CompleteSpace Y]
[SecondCountableTopology Y] in
/-- **Theorem [thm:E]** All parameter moments are bounded, also for vector-valued densities. -/
theorem thm_E_moments (ν : Measure H) [SigmaFinite ν] (ρ : SchwartzMap ℝ ℝ)
(hρ : IsBandPass ρ) (I : Set ℝ) (hI : IsFrequencyWindow ρ I) (r : ℕ) :
finiteCoefficientMomentConstant ρ r ≠ ⊤ ∧ ∀ G : H → Y, IsRegularAlongRays ν I G →
∫⁻ θ : H × ℝ, ENNReal.ofReal ((1 + ‖θ.1‖ + |θ.2|) ^ r) *
‖coefficientFormulaVec ρ G θ‖ₑ ∂parameterMeasure ν ≤
finiteCoefficientMomentConstant ρ r * rayMoment ν I G (r + 2) := by
Status: verified by comparator.
8.6.5. Theorem 6.5 — Constructive universal approximation with rates (thm:D)
Blueprint node: Theorem 5.3.1. Status: verified (all 3 Lean theorems verified).
Formalization note. thm_D is one existence theorem with a conjunction (the same G for all parts), as in the manuscript: G regular along rays (w.r.t. the explicit window I), ContDiff ℝ ⊤ G, ∃ R, ‖ξ‖ > R → G ξ = 0, (i) compactSupNorm K (f − g_G) < ε, (ii) g_G = integralNetworkDensity b λ_α γ_G as functions and ∀ m, Integrable ((1+‖a‖+|c|)^m ‖γ_G‖) λ_α (m = 0 is finiteness), (iii) ∀ L, LipschitzWith L b → ∀ N > 0, the expectation bound ε + 8V/√N(…) and a deterministic sample with the same bound. The activation is (β, b) with IsTemperedFunction β b (continuous, polynomial growth) and ¬IsPolynomialFun b; C^{(α)}_{β,ρ} = 1 is temperedAdmissibilityConst α β ρ = 1. thm_D_dense is the 'in particular' density of finite-width networks in C(H) (compact-open), stated as ∀ f K ε, ∃ finiteNetwork within ε on K. The density sentence sits inside Theorem 6.6 in the manuscript, under all of its hypotheses, so the Lean statement of thm_D_dense carries the full hypothesis list of thm_D (ν with SigmaFinite, IsOpenPosMeasure, IsHomogeneous α ν for α > 0 and hfin, the tempered activation (β, b) with ¬ IsPolynomialFun b, and the band-pass ρ with temperedAdmissibilityConst α β ρ = 1 and its frequency window I) and is proved from thm_D(i)-(ii) together with lem:qualitative-sampling, as the manuscript's proof does. thm_D_vec is the vector-valued sentence with Y a separable complex Hilbert space, coefficientFormulaVec, and, for (iii), the same explicit rate ε + 8V/√N(|b(0)| + Lip(b) R_K M₂) as in the scalar case, by the Hilbert-valued thm:lipschitz-barron, together with a deterministic width-N realization (the L²(ζ;Y) rate of cor:vector-rates(i) is not combined with (i), which is a C(K;Y) statement). Both thm_D and thm_D_vec carry one hypothesis the manuscript's sentence does not display, hfin : ∀ R, ν (Metric.closedBall 0 R) < ⊤ (the direction measure is finite on bounded sets), placed right after IsHomogeneous α ν: Step 2 of the proof normalizes a radial bump by ν of a ball and needs that mass finite. lem:homogeneous-mixture supplies it for the Gaussian mixture ν_α in infinite dimension, and the manuscript states thm:D for ν_α only — thm:general-weights deliberately omits thm:D from the results it extends to abstract weights. The hypothesis is not redundant: σ-finiteness, full support and homogeneity of degree α > 0 do not imply it (on ℝ² the measure carrying r^{α−1} dr on every ray of rational angle has all three and gives infinite mass to every nonempty open set, and for it every continuous G regular along rays vanishes, so (i) fails). The 2026-09-13 revision restated the vector-valued clause to claim the same explicit width-N bound through thm:lipschitz-barron, where it previously referred to the weaker vector-valued rate; thm_D_vec now carries that bound, and thm_D and thm_D_dense are unchanged.
OperatorRidgelet.Paper.thm_D, theorem in Challenge/Sampling.lean:
/-- **Theorem [thm:D]** Constructive universal approximation with rates. For a continuous,
polynomially growing, non-polynomial real `β` (the function `b` of the tempered `β`), a
band-pass `ρ` with `C^{(α)}_{β,ρ} = 1`, a continuous `f : H → ℂ`, a compact `K`, and `ε > 0`,
there is a spectral density `G`, regular along rays, smooth, and vanishing outside a bounded
set, such that (i) `‖f − g_G‖_{C(K)} < ε`; (ii) `g_G = S_β[γ_G λ_α]` with a coefficient
measure `γ_G λ_α` that is finite with finite moments of all orders; (iii) if `β` is globally
Lipschitz, the sampled network of `γ_G λ_α` satisfies
`𝔼‖f − f_N‖_{C(K)} ≤ ε + (8V/√N)(|β(0)| + Lip(β) R_K M₂)` with `V = ‖γ_G‖_{L¹(λ_α)}` and
`M₂` the second moment of `|γ_G| λ_α / V`, and at least one deterministic width-`N` network
satisfies the same bound. The direction measure is assumed finite on bounded sets (`hfin`),
which Lemma `lem:homogeneous-mixture` supplies for the Gaussian mixture `ν_α` in infinite
dimension and which the manuscript uses throughout, since it states the theorem for `ν_α`
only; the abstract hypotheses (σ-finite, full support, homogeneous of degree `α > 0`) do not
imply it, and Theorem `thm:general-weights` deliberately does not extend `thm:D` to abstract
weights. -/
theorem thm_D (ν : Measure H) [SigmaFinite ν] [ν.IsOpenPosMeasure] {α : ℝ} (hα : 0 < α)
(hν : IsHomogeneous α ν) (hfin : ∀ R : ℝ, ν (Metric.closedBall (0 : H) R) < ⊤)
(β : TemperedDistribution ℝ ℂ) (b : ℝ → ℝ)
(hβ : IsTemperedFunction β b) (hpoly : ¬ IsPolynomialFun b) (ρ : SchwartzMap ℝ ℝ)
(hρ : IsBandPass ρ) (hC : temperedAdmissibilityConst α β ρ = 1) (I : Set ℝ)
(hI : IsFrequencyWindow ρ I) {f : H → ℂ} (hf : Continuous f) {K : Set H}
(hK : IsCompact K) {ε : ℝ} (hε : 0 < ε) :
∃ G : H → ℂ, IsRegularAlongRays ν I G ∧ ContDiff ℝ (⊤ : ℕ∞) G ∧
(∃ R : ℝ, ∀ ξ : H, R < ‖ξ‖ → G ξ = 0) ∧
compactSupNorm K (fun x => f x - spectralTarget ν G x) < ε ∧
spectralTarget ν G =
integralNetworkDensity (fun t => (b t : ℂ)) (parameterMeasure ν)
(coefficientFormula ρ G) ∧
(∀ m : ℕ, Integrable
(fun θ : H × ℝ => (1 + ‖θ.1‖ + |θ.2|) ^ m * ‖coefficientFormula ρ G θ‖)
(parameterMeasure ν)) ∧
(∀ L : ℝ≥0, LipschitzWith L b → ∀ N : ℕ, 0 < N →
(∫ θ, compactSupNorm K (fun x =>
f x - densitySampledNetwork (fun t => (b t : ℂ)) (parameterMeasure ν)
(coefficientFormula ρ G) θ x)
∂sampleLaw N (densityLaw (parameterMeasure ν) (coefficientFormula ρ G)) ≤
ε + 8 * densityWeight (parameterMeasure ν) (coefficientFormula ρ G) / Real.sqrt N *
(|b 0| + (L : ℝ) * compactRadius K *
Real.sqrt
(secondMoment (densityLaw (parameterMeasure ν) (coefficientFormula ρ G))))) ∧
∃ θ : Fin N → H × ℝ,
compactSupNorm K (fun x =>
f x - densitySampledNetwork (fun t => (b t : ℂ)) (parameterMeasure ν)
(coefficientFormula ρ G) θ x) ≤
ε + 8 * densityWeight (parameterMeasure ν) (coefficientFormula ρ G) / Real.sqrt N *
(|b 0| + (L : ℝ) * compactRadius K *
Real.sqrt
(secondMoment (densityLaw (parameterMeasure ν) (coefficientFormula ρ G))))) := by
Status: verified by comparator.
OperatorRidgelet.Paper.thm_D_dense, theorem in Challenge/Sampling.lean:
/-- **Theorem [thm:D]** Constructive universal approximation with rates. In particular, under
the hypotheses of the theorem, the finite-width networks with the continuous, polynomially
growing, non-polynomial real activation `β` are dense in `C(H)` for the compact-open topology:
every continuous `f : H → ℂ` is approximated within `ε` on every compact `K` by a network of
some finite width `N`. The manuscript states the sentence inside Theorem `thm:D`, under all
of its hypotheses, and derives it from (ii) together with Lemma `lem:qualitative-sampling`
(from (iii) when `β` is in addition globally Lipschitz); the Lean statement therefore carries
the hypotheses of `thm_D`, including `hfin`. -/
theorem thm_D_dense (ν : Measure H) [SigmaFinite ν] [ν.IsOpenPosMeasure] {α : ℝ} (hα : 0 < α)
(hν : IsHomogeneous α ν) (hfin : ∀ R : ℝ, ν (Metric.closedBall (0 : H) R) < ⊤)
(β : TemperedDistribution ℝ ℂ) (b : ℝ → ℝ)
(hβ : IsTemperedFunction β b) (hpoly : ¬ IsPolynomialFun b) (ρ : SchwartzMap ℝ ℝ)
(hρ : IsBandPass ρ) (hC : temperedAdmissibilityConst α β ρ = 1) (I : Set ℝ)
(hI : IsFrequencyWindow ρ I) {f : H → ℂ} (hf : Continuous f) {K : Set H}
(hK : IsCompact K) {ε : ℝ} (hε : 0 < ε) :
∃ (N : ℕ) (v : Fin N → ℂ) (a : Fin N → H) (c : Fin N → ℝ),
compactSupNorm K (fun x => f x - finiteNetwork (fun t => (b t : ℂ)) v a c x) < ε := by
Status: verified by comparator.
OperatorRidgelet.Paper.thm_D_vec, theorem in Challenge/Sampling.lean:
/-- **Theorem [thm:D]** Constructive universal approximation with rates. The same statements
hold for continuous `f : H → Y` with values in a separable complex Hilbert space: there is a
`Y`-valued spectral density `G`, regular along rays, smooth, and vanishing outside a bounded
set, with (i) `‖f − g_G‖_{C(K;Y)} < ε`, (ii) `g_G = S_β[γ_G λ_α]` with a finite coefficient
measure with finite moments of all orders, and (iii), for globally Lipschitz `β`, the same
explicit rate `𝔼‖f − f_N‖_{C(K;Y)} ≤ ε + (8V/√N)(|β(0)| + Lip(β) R_K M₂)` as in the scalar
case, by the Hilbert-valued Theorem `thm:lipschitz-barron`, together with a deterministic
width-`N` realization. As in `thm_D`, the direction measure is assumed finite on bounded sets
(`hfin`). -/
theorem thm_D_vec {Y : Type*} [NormedAddCommGroup Y] [InnerProductSpace ℂ Y] [CompleteSpace Y]
[SecondCountableTopology Y] (ν : Measure H) [SigmaFinite ν] [ν.IsOpenPosMeasure] {α : ℝ}
(hα : 0 < α) (hν : IsHomogeneous α ν)
(hfin : ∀ R : ℝ, ν (Metric.closedBall (0 : H) R) < ⊤) (β : TemperedDistribution ℝ ℂ)
(b : ℝ → ℝ) (hβ : IsTemperedFunction β b) (hpoly : ¬ IsPolynomialFun b)
(ρ : SchwartzMap ℝ ℝ) (hρ : IsBandPass ρ) (hC : temperedAdmissibilityConst α β ρ = 1)
(I : Set ℝ) (hI : IsFrequencyWindow ρ I) {f : H → Y} (hf : Continuous f) {K : Set H}
(hK : IsCompact K) {ε : ℝ} (hε : 0 < ε) :
∃ G : H → Y, IsRegularAlongRays ν I G ∧ ContDiff ℝ (⊤ : ℕ∞) G ∧
(∃ R : ℝ, ∀ ξ : H, R < ‖ξ‖ → G ξ = 0) ∧
compactSupNorm K (fun x => f x - spectralTarget ν G x) < ε ∧
spectralTarget ν G =
integralNetworkDensity (fun t => (b t : ℂ)) (parameterMeasure ν)
(coefficientFormulaVec ρ G) ∧
(∀ m : ℕ, Integrable
(fun θ : H × ℝ => (1 + ‖θ.1‖ + |θ.2|) ^ m * ‖coefficientFormulaVec ρ G θ‖)
(parameterMeasure ν)) ∧
(∀ L : ℝ≥0, LipschitzWith L b → ∀ N : ℕ, 0 < N →
(∫ θ, compactSupNorm K (fun x =>
f x - densitySampledNetwork (fun t => (b t : ℂ)) (parameterMeasure ν)
(coefficientFormulaVec ρ G) θ x)
∂sampleLaw N (densityLaw (parameterMeasure ν) (coefficientFormulaVec ρ G)) ≤
ε + 8 * densityWeight (parameterMeasure ν) (coefficientFormulaVec ρ G) / Real.sqrt N *
(|b 0| + (L : ℝ) * compactRadius K *
Real.sqrt
(secondMoment
(densityLaw (parameterMeasure ν) (coefficientFormulaVec ρ G))))) ∧
∃ θ : Fin N → H × ℝ,
compactSupNorm K (fun x =>
f x - densitySampledNetwork (fun t => (b t : ℂ)) (parameterMeasure ν)
(coefficientFormulaVec ρ G) θ x) ≤
ε + 8 * densityWeight (parameterMeasure ν) (coefficientFormulaVec ρ G) /
Real.sqrt N *
(|b 0| + (L : ℝ) * compactRadius K *
Real.sqrt
(secondMoment
(densityLaw (parameterMeasure ν) (coefficientFormulaVec ρ G))))) := by
Status: verified by comparator.
8.6.6. Corollary 6.6 — Vector-valued rates (cor:vector-rates)
Blueprint node: Corollary 5.4.1. Status: verified (all 5 Lean theorems verified).
Formalization note. Y a separable complex Hilbert space, Γ a VectorMeasure (H × ℝ) Y with finite variation, β : ℝ → ℂ with LipschitzWith L β, second moment as Integrable (‖a‖²+|c|²) (polarLaw Γ). Part i is split into the two inequalities i_a (‖·‖²_{L²(ζ;Y)} written as ∫ ‖·‖² dζ, ζ a probability measure with Integrable ‖x‖² ζ) and i_b (explicit bound with ‖β 0‖² and L²); part ii into ii_a (2V 𝔑^Y_N bound, with 𝔑^Y_N = rademacherComplexity with Y-valued phase polarDensity Γ) and ii_b (Tendsto to 0 as N → ∞). N > 0 in i and ii_a. Parts i_a, ii_a and ii_b explicitly carry SecondCountableTopology H, the standing separability hypothesis, for joint measurability and the compact atom map. The Hilbert-valued polar decomposition is proved from the Riesz representation theorem on L² of the variation measure. The compact bound uses Banach-valued symmetrization; convergence follows from the L¹ law of large numbers for the signed compact atom map, without a dimension-free Banach-space rate.
OperatorRidgelet.Paper.cor_vector_rates_i_a, theorem in Challenge/Sampling.lean:
/-- **Corollary [cor:vector-rates]** Vector-valued rates. For globally Lipschitz `β`, a
`Y`-valued `Γ` whose law `p = |Γ|/V` has finite second moment, and every Borel probability
measure `ζ` on `H` with `∫ ‖x‖² dζ < ∞`,
`𝔼‖f_N − f‖²_{L²(ζ;Y)} ≤ (V²/N) ∫ ‖β(⟪a,·⟫ + c)‖²_{L²(ζ)} dp`. -/
theorem cor_vector_rates_i_a [MeasurableSpace H] [BorelSpace H] [SecondCountableTopology H]
{β : ℝ → ℂ} {L : ℝ≥0}
(hβ : LipschitzWith L β) (Γ : VectorMeasure (H × ℝ) Y) [IsFiniteMeasure Γ.variation]
(hM : Integrable (fun θ : H × ℝ => ‖θ.1‖ ^ 2 + |θ.2| ^ 2) (polarLaw Γ)) (ζ : Measure H)
[IsProbabilityMeasure ζ] (hζ : Integrable (fun x : H => ‖x‖ ^ 2) ζ) {N : ℕ} (hN : 0 < N) :
∫ θ, (∫ x, ‖polarSampledNetwork β Γ θ x - integralNetwork β Γ x‖ ^ 2 ∂ζ)
∂sampleLaw N (polarLaw Γ) ≤
polarWeight Γ ^ 2 / N * ∫ θ, (∫ x, ‖β (⟪θ.1, x⟫ + θ.2)‖ ^ 2 ∂ζ) ∂polarLaw Γ := by
Status: verified by comparator.
OperatorRidgelet.Paper.cor_vector_rates_i_b, theorem in Challenge/Sampling.lean:
/-- **Corollary [cor:vector-rates]** Vector-valued rates. The `L²(ζ;Y)` rate is explicit:
`(V²/N) ∫ ‖β(⟪a,·⟫ + c)‖²_{L²(ζ)} dp ≤ (2V²/N)(|β(0)|² + Lip(β)² (1 + ∫ ‖x‖² dζ) M₂²)`. -/
theorem cor_vector_rates_i_b [MeasurableSpace H] [BorelSpace H] {β : ℝ → ℂ} {L : ℝ≥0}
(hβ : LipschitzWith L β) (Γ : VectorMeasure (H × ℝ) Y) [IsFiniteMeasure Γ.variation]
(hM : Integrable (fun θ : H × ℝ => ‖θ.1‖ ^ 2 + |θ.2| ^ 2) (polarLaw Γ)) (ζ : Measure H)
[IsProbabilityMeasure ζ] (hζ : Integrable (fun x : H => ‖x‖ ^ 2) ζ) {N : ℕ} (hN : 0 < N) :
polarWeight Γ ^ 2 / N * ∫ θ, (∫ x, ‖β (⟪θ.1, x⟫ + θ.2)‖ ^ 2 ∂ζ) ∂polarLaw Γ ≤
2 * polarWeight Γ ^ 2 / N *
(‖β 0‖ ^ 2 + (L : ℝ) ^ 2 * (1 + ∫ x, ‖x‖ ^ 2 ∂ζ) * secondMoment (polarLaw Γ)) := by
Status: verified by comparator.
OperatorRidgelet.Paper.cor_vector_rates_ii_a, theorem in Challenge/Sampling.lean:
/-- **Corollary [cor:vector-rates]** Vector-valued rates. For every compact `K`,
`𝔼‖f_N − f‖_{C(K;Y)} ≤ 2V 𝔑^Y_N(K; p, β)`, where `𝔑^Y_N` is the Rademacher complexity with the
absolute value replaced by the norm of `Y`. -/
theorem cor_vector_rates_ii_a [MeasurableSpace H] [BorelSpace H] [SecondCountableTopology H]
{β : ℝ → ℂ} {L : ℝ≥0}
(hβ : LipschitzWith L β) (Γ : VectorMeasure (H × ℝ) Y) [IsFiniteMeasure Γ.variation]
(hM : Integrable (fun θ : H × ℝ => ‖θ.1‖ + |θ.2|) (polarLaw Γ)) {K : Set H}
(hK : IsCompact K) {N : ℕ} (hN : 0 < N) :
∫ θ, compactSupNorm K (fun x => polarSampledNetwork β Γ θ x - integralNetwork β Γ x)
∂sampleLaw N (polarLaw Γ) ≤
2 * polarWeight Γ * rademacherComplexity N K (polarLaw Γ) β (polarDensity Γ) := by
Status: verified by comparator.
OperatorRidgelet.Paper.cor_vector_rates_ii_b, theorem in Challenge/Sampling.lean:
/-- **Corollary [cor:vector-rates]** Vector-valued rates. For every compact `K`,
`𝔑^Y_N(K; p, β) → 0` as `N → ∞`. -/
theorem cor_vector_rates_ii_b [MeasurableSpace H] [BorelSpace H] [SecondCountableTopology H]
{β : ℝ → ℂ} {L : ℝ≥0}
(hβ : LipschitzWith L β) (Γ : VectorMeasure (H × ℝ) Y) [IsFiniteMeasure Γ.variation]
(hM : Integrable (fun θ : H × ℝ => ‖θ.1‖ + |θ.2|) (polarLaw Γ)) {K : Set H}
(hK : IsCompact K) :
Tendsto (fun N : ℕ => rademacherComplexity N K (polarLaw Γ) β (polarDensity Γ)) atTop
(𝓝 0) := by
Status: verified by comparator.
OperatorRidgelet.Paper.cor_vector_rates_i_exact, theorem in Challenge/SamplingRevision.lean:
/-- **Corollary [cor:vector-rates](i).** The exact integrated variance of the sampled network,
including the subtracted squared norm of its target and the zero-variation case. -/
theorem cor_vector_rates_i_exact {H Y : Type*}
[NormedAddCommGroup H] [InnerProductSpace ℝ H] [MeasurableSpace H] [BorelSpace H]
[SecondCountableTopology H] [NormedAddCommGroup Y] [InnerProductSpace ℂ Y]
[CompleteSpace Y] {β : ℝ → ℂ} {L : ℝ≥0}
(hβ : LipschitzWith L β) (Γ : VectorMeasure (H × ℝ) Y) [IsFiniteMeasure Γ.variation]
(hM : Integrable (fun θ : H × ℝ => ‖θ.1‖ ^ 2 + |θ.2| ^ 2) (polarLaw Γ))
(ζ : Measure H) [IsProbabilityMeasure ζ] (hζ : Integrable (fun x : H => ‖x‖ ^ 2) ζ)
{N : ℕ} (hN : 0 < N) :
∫ θ, (∫ x, ‖polarSampledNetwork β Γ θ x - integralNetwork β Γ x‖ ^ 2 ∂ζ)
∂sampleLaw N (polarLaw Γ) =
(N : ℝ)⁻¹ * (polarWeight Γ ^ 2 *
(∫ θ, (∫ x, ‖β (⟪θ.1, x⟫ + θ.2)‖ ^ 2 ∂ζ) ∂polarLaw Γ) -
∫ x, ‖integralNetwork β Γ x‖ ^ 2 ∂ζ) := by
Status: verified by comparator.