Alphabeta Math
CounterexampleConstruction: AI-generatedVerification: 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.

A disordered fixed-neighbor stencil can fail derivative consistency

Statement refuted

Keeping the same finite neighbor pattern in units of ε while refining ε alone guarantees consistency of a meshfree particle derivative. The following explicit periodic family refutes this claim for an affine field.

Facts & Assumptions

Given: In one dimension use W(s)=(35/32)(1−s²)³ for |s|≤1 and zero otherwise, W_ε(s)=ε^(−1)W(s/ε), and the periodic node set P_ε={ε(4k+r): k∈Z, r∈{0,3/5,2,7/2}} with its nearest-node intervals, bounded by midpoints of consecutive nodes (the Voronoi cells), and cell volumes V_j. The rule is used on Ω=R with periodic node pattern.

[F1]

Scaled symmetric compactly supported kernel family: W_ε is supported on [−ε,ε] and the particle kernel derivative is ∂_xW_ε(x−y).

[F2]

Meshfree cell quadrature and fill radius: the particle sum is Q_hg=Σ_jV_jg(x_j), and an integration-compatible rule satisfies ∫Ωg=Σ{j:C_j∩supp(g)≠∅}∫_{C_j}g for each compactly supported continuous g.

[F3]

Second-order bias for the kernel particle gradient: if f∈C³ has bounded third derivative, then the continuous kernel-gradient target D_εf differs from f′ by at most (m₃/6)ε²||f‴||∞.

[F4]

A continuous real function on a compact Jordan measurable set is Riemann integrable over that set: a continuous real function on a compact Jordan-measurable set is Riemann integrable there.

Counterexample

1.1givenF2algebra

The adjacent gaps in one period are 3ε/5, 7ε/5, 3ε/2, and ε/2, so the fill radius is h=3ε/4. The four Voronoi-cell lengths per period are 11ε/20, ε, 29ε/20, and ε; hence every volume is at most 2h. If a cell meets B(x,r), its node lies in B(x,r+h). Nodes are separated by at least ε/2, so at most 1+4(r+h)/ε such nodes can lie in that interval. Each cell volume is at most 29ε/20, and r+h≥3ε/4; therefore the total active volume is at most (29/20)ε+(29/5)(r+h)≤(116/15)(r+h)≤8(r+h). The local-volume bound holds with C_L=8. In particular, the cells at −ε/2 and 3ε/5 are [−5ε/4,−ε/4] and [3ε/10,13ε/10], each of volume ε.

2.1F2F4F5step 1.1choose

The nearest-node intervals tile R, repeat with period 4ε, and have gaps between their endpoints only at shared cell boundaries. Every compact support meets finitely many intervals. For any compactly supported continuous g, choose a finite consecutive block of cells containing supp(g); [F4] makes g integrable on its compact union, and repeated [F5] splits that integral into the cell integrals. Cells outside the block have zero integral because they do not meet supp(g). Thus the integration-compatibility identity in [F2] holds for every compactly supported continuous g.

3.1F1F2step 2.1algebra

On |s|<1, W′(s)=−(105/16)s(1−s²)². For f(y)=y at x=0, set g(y)=y,\partial_xW_\varepsilon(x-y)|_{x=0}. By [F1], g vanishes outside [−ε,ε], and [F2] defines its particle sum as Q_hg=Σ_jV_jg(x_j). The node at 0 contributes zero; only y=−ε/2 and y=3ε/5 contribute, with values −W′(1/2)/2=945/1024 and −(3/5)W′(3/5)=3024/3125. Thus Q_hg=945/1024+3024/3125, independent of ε.

4.1F3step 3.1algebra∎

Here f′(0)=1 and f‴=0, so [F3] gives D_εf(0)=1 exactly. Since each summand in the value from step 3.1 exceeds 1/2, that value is greater than 1 for every ε. The derivative error therefore does not tend to zero although h/ε=3/4 remains fixed.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

35 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