Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge 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.

Bounded local spline quasi-interpolants

Definition

Fix a bounded interval [a,b], a degree p∈N0, an exponent 1≤q≤∞, an integer 0≤l≤p, and a nonempty family T of clamped degree-p knot meshes on [a,b]. A mesh-uniform bounded local quasi-interpolant is a family of real-linear maps Qξ:C([a,b];R)→Sp,ξ, one for each ξ∈T, for which there are common constants M∈N and 0≤CQ<∞ such that the following hold for every ξ∈T and every nonempty cell Im of its mesh: there is a neighborhood Jξ,m⊆[a,b] containing Im and formed from at most M adjacent knot cells; each point of [a,b] belongs to at most M of the neighborhoods Jξ,m; (i) if f=g almost everywhere on Jξ,m, then Qξf=Qξg almost everywhere on Im; (ii) Qξv=v for every v∈Pl; and (iii) ∥Qξf∥Lq(Im)≤CQ∥f∥Lq(Jξ,m). The constants M and CQ are independent of ξ. The derivative and continuous-representative conventions for Sobolev inputs are those of Integer-order Sobolev spaces and their norms and One-dimensional W1,p functions have unique absolutely continuous representatives.

For a fixed mesh, the coefficient-functional formulation in Lyche–Manni–Speleers is one sufficient way to obtain these local stability and reproduction properties. Uniform constants in that construction give a family as defined here; this definition records the operator hypotheses used in the approximation proof.

Depends on

Used by

Dependency tree · two levels

33 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