Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Separated Matérn sites have a positive Gram lower bound

Statement

Assume Countable Choice. Fix d≥1, ν>0, a>0, s=ν+d/2, and the normalized Matérn kernel with spectral density w(ξ)=A(a2+4π2∣ξ∣2)−s from The normalized Matérn kernel in the 2π Fourier convention. For a list of N≥2 distinct sites X=(x1,…,xN)⊂Rd, put q=12min⁡i≠j∣xi−xj∣. There is c=c(d,ν,a)>0 such that if 0<q≤1, then λmin⁡(KX)≥cq2ν,λmax⁡(KX)≤N,κ2(KX)≤c−1Nq−2ν. The eigenvalues and condition number are those of the exact real symmetric positive-definite matrix. For N=1, KX=[1] and κ2(KX)=1.

Facts & Assumptions

Given: Countable Choice, fixed Matérn parameters, N≥2 distinct sites, and 0<q≤1.

[F1]

The spectral density is positive, w(ξ)=A(a2+4π2∣ξ∣2)−s, and k(z)=∫w(ξ)e2πiz⋅ξdξ. (The normalized Matérn kernel in the 2π Fourier convention, The Matérn spectral integral, normalization, and radial formula)

[F2]

The Matérn kernel is real and even, with k(0)=1, so its Gram matrix is real symmetric and every diagonal entry is one. (The Matérn spectral integral, normalization, and radial formula)

[F5]

A smooth bump can be chosen equal to one on the half-radius ball and supported in the unit ball. (A smooth bump between concentric Euclidean balls, Euclidean balls have positive finite Lebesgue measure)

[F6]

The induced matrix 2-norm of a symmetric matrix is its largest absolute eigenvalue. (A symmetric matrix operator norm is its largest absolute Rayleigh quotient, The matrix norm induced by a published vector p-norm)

[F7]

The nonnegative integral is monotone and the modulus of an integral is bounded by the integral of the modulus. (Monotonicity and nonnegative homogeneity of the nonnegative integral, The modulus of an integral is bounded by the integral of the modulus)

[F8]

Smooth compactly supported functions are Schwartz, and the negative-sign, 2π-normalized Fourier transform maps Schwartz functions to Schwartz functions. (Schwartz space and its seminorms, Fourier transform acts continuously on Schwartz space)

[F9]

Euler's formula gives ∣eit∣=1 for real t and eit‾=e−it. (exp⁡(x+iy)=ex(cos⁡y+isin⁡y), ∣exp⁡(x+iy)∣=ex, and eiπ+1=0)

[F11]

The positive p-series ∑n≥1n−p converges for p>1. (The p-series for a real exponent p converges exactly when p is greater than one)

[A1]

Countable Choice is inherited from the spectral normalization, ball and Lebesgue measure, and Schwartz Fourier-transform suppliers; no choice of sites or window functions is made from an arbitrary family. (The Axiom of Countable Choice (ACω))

Proof technique: localized spectral window, packing, and Rayleigh quotients.

Proof

technique · localized spectral window, packing, and Rayleigh quotients

Given: The hypotheses above.

1.1F3F5F7F9A1algebrachoose

By [F5] choose a smooth function ρ:Rd→[0,1] equal to one on B‾(0,1/2) and supported in B(0,1). Set η(ξ)=(ρ(ξ)+ρ(−ξ))/2. Then η is smooth, even, nonnegative, at most one, still equals one on the half-radius ball, and is supported in the unit ball. Define ψ(z)=∫η(ξ)e2πiz⋅ξdξ. Reflection invariance of Lebesgue measure [F3] and Euler's formula [F9] make ψ real and even, and monotonicity [F7] gives ψ(0)=∫η≥λ(B(0,1/2))>0.

2.1F7F8F9step 1.1algebra

Since η is smooth and compactly supported, it is Schwartz by [F8], so η^ is Schwartz and ψ(z)=η^(−z) is Schwartz as well. For ∣z∣≥1, choose a coordinate j with ∣zj∣≥∣z∣/d; the Schwartz seminorm sup⁡ξ∣ξjMη^(ξ)∣<∞ gives ∣ψ(z)∣≤CM∣z∣−M. For ∣z∣≤1, [F7] and ∣e2πiz⋅ξ∣=1 from [F9] give ∣ψ(z)∣≤∫η. Combining the two bounds yields ∣ψ(z)∣≤CM′(1+∣z∣)−M.

3.1F3F11A1step 2.1givenchoose

Fix i. The open balls B(xj,q) are pairwise disjoint because center distances are at least 2q. If n≤∣xi−xj∣/q<n+1, then B(xj,q)⊂B(xi,(n+2)q). Translation invariance and dilation change of variables in [F3] give λ(B(x,r))=rdλ(B(0,1)); this unit-ball measure is finite and positive. Finite additivity on the disjoint balls therefore bounds the number of such j by (n+2)d. Hence, for any integer M>d+1 and T≥1, [step 2.1] yields the uniform row-sum estimate ∑j≠i∣ψ ⁣(T(xi−xj)/q)∣≤CMT−M∑n≥1(n+2)dn−M. For n≥1, (n+2)d≤3dnd, so this series is bounded by 3d∑n≥1n−(M−d), which converges by [F11] because M−d>1. Choose one fixed T large enough that this upper bound is at most ψ(0)/2.

4.1F3step 3.1algebra

For any c∈CN, the quadratic form of Hij=ψ(T(xi−xj)/q) satisfies c∗Hc≥(ψ(0)−max⁡i∑j≠i∣Hij∣)∥c∥22≥ψ(0)2∥c∥22, because each off-diagonal pair is bounded using 2∣ci∣∣cj∣≤∣ci∣2+∣cj∣2. By the change of variables ζ=(q/T)ξ, ∫∣ξ∣≤T/q∣∑jcje−2πixj⋅ξ∣2dξ≥∫η(qξ/T)∣∑jcje−2πixj⋅ξ∣2dξ=(T/q)dc∗Hc. The first inequality uses 0≤η≤1 and support in the unit ball.

5.1F1F4F10step 4.1algebra

On ∣ξ∣≤T/q and q≤1, set B=(a2+4π2T2)q−2. Then a2+4π2∣ξ∣2≤a2+4π2T2/q2≤B. Monotonicity and the power laws [F10] give w(ξ)≥AB−s=A(a2+4π2T2)−sq2s. Using the Fourier quadratic-form identity from [F1] and step 4.1 gives c∗KXc≥c0q2s−d∥c∥22=c0q2ν∥c∥22 for a constant c0>0 independent of X,q,N. Thus [F4] yields λmin⁡(KX)≥c0q2ν.

6.1F2F4F6step 5.1algebra∎

By [F4], choose an orthonormal eigenbasis and write KX=QΛQT. If Q=(qij), then tr⁡(KX)=∑i(KX)ii=∑i,jqij2λj=∑jλj=N, since each column of Q has unit norm and [F2] gives diagonal entries k(0)=1. By step 5.1 all eigenvalues are positive, so λmax⁡(KX)≤N. In this eigenbasis the induced 2-norms of KX and KX−1 are λmax⁡ and 1/λmin⁡, respectively, by [F6]. The definition κ2(KX)=∥KX∥2∥KX−1∥2 therefore gives κ2(KX)≤c−1Nq−2ν. The N=1 case follows directly from k(0)=1 and the same definition.

Depends on

Used by

Dependency tree · two levels

133 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources