Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-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.

Cellwise oscillation bound for particle quadrature

Statement

Let g be compactly supported and Lipschitz with constant L_g, meaning |g(y)−g(x)|≤L_g|y−x|, with supp(g)⊂Ω, and use the cells and nodes of Meshfree cell quadrature and fill radius. Define osc_C(g)=sup_{y,z∈C}|g(y)−g(z)| and let J_g={j:C_j∩supp(g)≠∅}. Then

∣∫Ωg(y)dy−Qhg∣≤∑j∈JgVjosc⁡Cj(g)≤2hLg∑j∈JgVj.

Facts & Assumptions

Given: A compactly supported Lipschitz g with supp(g)⊂Ω and a cell particle rule.

[F1]

Meshfree cell quadrature and fill radius: only finitely many cells meet supp(g), their integrals sum to ∫Ωg, V_j=∫1{C_j}, and |y−x_j|≤h on C_j.

[F3]

Linearity, monotonicity, the absolute-value estimate and coordinate-slice additivity for the Riemann integral in Rm: on a bounding rectangle, the Riemann integral is linear, monotone, and satisfies |∫u|≤∫|u|; the Jordan-cell integrals use their zero extensions to such rectangles.

Proof

1.1F1F3algebra

By the integration-compatible partition in [F1] and linearity in [F3], subtracting Q_hg cell by cell gives ∫Ωg−Q_hg=Σ{j∈J_g}∫{C_j}(g(y)−g(x_j))dy, using ∫{C_j}g(x_j)=V_jg(x_j). On a bounding rectangle for each cell, [F3] gives |∫{C_j}(g−g(x_j))|≤∫{C_j}|g−g(x_j)|≤V_j osc_{C_j}(g). Summing proves the first inequality.

2.1F1F2step 1.1algebra∎

For y,z∈C_j, [F1] gives |y−x_j|≤h and |z−x_j|≤h; the triangle inequality in [F2] gives |y−z|≤2h. Hence |g(y)−g(z)|≤2hL_g and osc_{C_j}(g)≤2hL_g. Substituting this bound in step 1.1 proves the second inequality.

Depends on

Used by

Dependency tree · two levels

26 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