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

Cell averaging is the L2 projection onto P0

Statement

For a finite conforming simplicial mesh of bounded D, define P0:L2(D)→P0(Th) cellwise by (P0g)∣K=∣K∣−1∫Kg. Then P0 is linear, equals the identity on piecewise constants, is the L2-orthogonal projection onto that space, satisfies ∥P0g∥2≤∥g∥2, and preserves the integral ∫DP0g=∫Dg.

Facts & Assumptions

Given: A finite conforming mesh of bounded D and g∈L2(D).

[F1]

The mesh cells have positive finite measure, disjoint interiors, and cover D up to their measure-zero affine faces. (Matching affine simplicial meshes and shape regularity, Every affine hyperplane of Rn, and hence every proper linear subspace, is Lebesgue null)

[F2]

Cauchy–Schwarz gives ∣∫Kg∣≤∣K∣1/2∥g∥L2(K). (Cauchy-Schwarz inequality for L2)

Proof

1.1F1givenalgebra

The cell integral is linear, so the formula defines a linear piecewise-constant map. If g is constant on each cell, its cell average is the same constant, so P0g=g. For any piecewise constant qh, ∫D(g−P0g)qh=∑KqK(∫Kg−∣K∣ ∣K∣−1∫Kg)=0. Thus the range is orthogonal to the residual and P0 is the orthogonal projection onto P0(Th).

2.1F1F2algebra∎

By [F2], ∣K∣ ∣(P0g)∣K∣2=∣K∣−1∣∫Kg∣2≤∫K∣g∣2. Summing over cells gives ∥P0g∥22≤∥g∥22. Summing the defining averages multiplied by cell measures gives ∫DP0g=∑K∫Kg=∫Dg.

Depends on

Used by

Dependency tree · two levels

25 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