Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedverified 2026-10-22 (gpt-6.1-sol)
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.

Mean-zero NtD map and smoothed kernel observation

Definition

Assume the Axiom of Choice and Countable Choice. Let d≥2, let Ω⊂(0,1)d be nonempty, bounded, connected and C∞, fix an open domain Ω′⋐Ω and real parameters m>0, M≥max⁡{1,m}, R>0 and 0<α<1 defining Xd(R), and let γ∈Xd(R) be a real conductivity. Write M=∂Ω, let dS be surface measure, and set L02(M)={f∈L2(M):∫Mf dS=0},P0f=f−∣M∣−1∫Mf dS. The mean-zero Neumann-to-Dirichlet operator Rγ:L02(M)→L02(M) sends f to the mean-zero boundary trace of the weak solution of ∇⋅(γ∇u)=0 with outward conormal flux f, as defined by the weak Neumann problem. Let −ΔM be the nonnegative Laplace–Beltrami operator on the compact boundary manifold, with eigenpairs (ej,λj) on L02(M) from its spectral resolution. For τ=1/2 when d=2 and any fixed τ>0 when d≥3, put rd:=d−12−1+τ,CMrd/2ej=(1+λj)−rd/2ej. The smoothed observation is the bounded operator Aγ:=RγCMrd/2:L02(M)→L02(M). Its extension to all of L2(M) is A~γf=ι0Aγ(P0f), where ι0:L02(M)↪L2(M) is inclusion. Thus its integral kernel, when it exists in L2(M×M), is fixed to have zero mean in each variable. No assertion of a kernel's existence or Hilbert–Schmidt regularity is part of this definition.

Depends on

Used by

Dependency tree · two levels

30 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