Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck 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.

Global boundary-flux estimate on a matching mesh

Statement

Assume Countable Choice and the nonempty mesh hypotheses of Symmetric and nonsymmetric Nitsche boundary forms. Let N∂ be the maximum number of boundary facets incident to a single cell, and use the selected positive local constant Ctr≥1 from Local inverse trace bound for a polynomial normal flux. The mesh has at least one boundary facet, so 1≤N∂≤d+1 and C∂:=N∂Ctr≥1. For every vh∈Vh, (∑F∈Fh∂hF∥∂nvh∥L2(F)2)1/2≤C∂∥∇vh∥L2(Ω),C∂:=N∂ Ctr. Consequently, ∣∑F∈Fh∂∫F(∂nvh)vh dS∣≤C∂∥∇vh∥L2(Ω)(∑F∈Fh∂hF−1∥vh∥L2(F)2)1/2. For simplices N∂≤d+1; no sharper face-count bound is needed.

Facts & Assumptions

Given: Countable Choice; the finite matching mesh and boundary facets of Symmetric and nonsymmetric Nitsche boundary forms; the local inverse-trace bound of Local inverse trace bound for a polynomial normal flux; and vh∈Vh.

[F1]

For each boundary facet F with incident cell KF, hF∥∂nvh∥L2(F)2≤Ctr2∥∇vh∥L2(KF)2 (Local inverse trace bound for a polynomial normal flux).

[F2]

A d-simplex has exactly d+1 facets; when the sum ranges over boundary facets, each cell gradient term is therefore counted at most d+1 times.

[F3]

Distinct mesh-cell interiors are disjoint, and every boundary facet has one incident cell (Matching affine simplicial meshes and shape regularity).

[F4]

Cauchy–Schwarz for finite sums and for the L2(F) integrals gives ∣∫Fab∣≤∥a∥L2(F)∥b∥L2(F).

Proof

Given: The finite boundary-facet incidence family and [F1]–[F3].

1.1F1F2given

Sum [F1] over all boundary facets. Each cell contributes at most N∂ copies of its squared gradient norm, so ∑FhF∥∂nvh∥F2≤N∂Ctr2∑K∥∇vh∥K2=N∂Ctr2∥∇vh∥Ω2. Taking square roots proves the first inequality.

1.2F1F3givenchoose

Choose a point x0 in the interior of a mesh cell. The finite union of cells is compact and bounded, so the ray x0+tv has a last point in that union for every unit direction v. Choose v outside the finitely many measure-zero sets of directions whose ray meets a cell face of dimension at most d−2 or is parallel to a facet plane; the excluded directions are measure zero because each such face has dimension at most d−2 and radial projection from x0 has dimension at most d−2 on the (d−1)-sphere. The last point therefore lies in the relative interior of a facet and the ray crosses it transversally. If two cells meet at a point in the relative interior of a common facet, their interiors lie on opposite sides: if both lay on the same side of its affine hyperplane, a sufficiently small point displaced to that side near the facet point would lie in the interior of both nondegenerate simplices, contradicting their disjoint interiors in [F3]. Thus such a shared-facet point is interior to the union, contrary to its being the last point on the ray. The last point is consequently on a one-cell boundary facet. Since the local result gives Ctr≥1, we obtain 1≤N∂ and C∂=N∂Ctr≥1.

2.1F4step 1.1algebra∎

Apply [F4] on each facet and then finite-sum Cauchy–Schwarz to obtain ∣∑F∫F(∂nvh)vh∣≤∑F(hF1/2∥∂nvh∥F)(hF−1/2∥vh∥F)≤(∑FhF∥∂nvh∥F2)1/2(∑FhF−1∥vh∥F2)1/2. Substitute the first inequality from step 1.1 to get the stated bound.

Depends on

Used by

Dependency tree · two levels

18 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