Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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.

The restricted Matérn native space is the Sobolev quotient space

Statement

Assume full AC conservatively for the declared Hilbert projection dependency. Fix the Matérn kernel of The normalized Matérn kernel in the 2π Fourier convention on a nonempty domain Ω of Radial kernels, polynomial augmentation, and site geometry. Let NΩ={U∈Hk(Rd):U∣Ω=0}. The restricted native space is the quotient Hk(Rd)/NΩ with infimal extension norm, and it is the reproducing-kernel Hilbert space of k∣Ω×Ω. Its norm is equivalent to the restriction-quotient norm of Hs(Ω): for constants c,C>0 depending only on d,ν,a, c∥u∥Hs(Ω)≤∥u∥Hk(Ω)≤C∥u∥Hs(Ω). No extension theorem or intrinsic fractional-domain norm is asserted.

Facts & Assumptions

Given: Full AC, fixed Matérn parameters, a nonempty domain Ω, and the quotient definitions above.

[F1]

The whole-space Matérn native space and Hs(Rd) have the same representatives and equivalent norms with constants c0,C0>0. (The Matérn native space has its weighted Fourier norm and strict Gram positivity)

[F2]

Point evaluations are continuous in the whole-space native norm; each section k(⋅−y) reproduces evaluation and the sections centered in Rd span densely. (The Matérn native space has its weighted Fourier norm and strict Gram positivity)

[F3]

A closed subspace of a Hilbert space has a closed orthogonal complement, each vector has a unique orthogonal projection, and the quotient by the subspace is isometric to that complement. (Orthogonal decomposition by a closed subspace, Hilbert projections are linear, self-adjoint and contractive)

[A1]

Full AC is included to match the conservative dependency branch of [F3] and the published L2 completeness supplier; no family of extensions is selected. (The Axiom of Choice, The Axiom of Countable Choice (ACω))

Proof

technique · direct

Given: The hypotheses and notation of the Statement.

1.1F2algebra

The set NΩ is a linear subspace. If Un∈NΩ converges to U in native norm, then for each x∈Ω, [F2] gives ∣Un(x)−U(x)∣≤Cx∥Un−U∥k→0; hence U(x)=0 and U∈NΩ. Thus NΩ is closed.

2.1F3A1step 1.1

By [F3], each equivalence class modulo NΩ has a unique representative in NΩ⊥, namely its orthogonal projection onto that complement; its norm is the infimum of the norms of all extensions because adding an element of NΩ changes only the nullspace component. Therefore the restriction quotient is a Hilbert space isometric to NΩ⊥.

3.1F2step 2.1

For y∈Ω, the section ky=k(⋅−y) lies in NΩ⊥: for every N∈NΩ, ⟨N,ky⟩k=N(y)=0 by reproduction [F2]. Its induced quotient element therefore represents the restricted kernel section, and it reproduces evaluation of each restricted function at y.

4.1F2step 1.1step 3.1

If U∈NΩ⊥ is orthogonal to every ky with y∈Ω, then [F2] gives U(y)=0 for all y∈Ω, so U∈NΩ. Thus U∈NΩ∩NΩ⊥={0}. The restricted kernel sections span densely in NΩ⊥, which proves that the quotient is exactly the RKHS of the restricted kernel.

5.1F1step 2.1algebra∎

Every extension U of u satisfies c0∥U∥Hs(Rd)≤∥U∥k≤C0∥U∥Hs(Rd) by [F1]. Taking the infimum over the same set of extensions on both sides gives c0∥u∥Hs(Ω)≤∥u∥Hk(Ω)≤C0∥u∥Hs(Ω).

Depends on

Used by

Cited to discharge well-definedness by Fourier Bessel-potential and restriction-quotient Sobolev spaces.

Dependency tree · two levels

40 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