Alphabeta Math
Pipeline-generated
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.

✓ 3 results · all verified · 2 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 1 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Nitsche methods for weak boundary enforcement — Examples

1 · Prerequisites

2 · Summary

These examples check the sufficient penalty threshold against a penalty-free constant mode, show that affine boundary data can be recovered exactly by weak imposition, and use the proved fractional weak Green identity to isolate the boundary-flux term responsible for the symmetric/nonsymmetric difference in the L2 duality argument.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

Exact affine data under weak imposition

Example

Assume Countable Choice. Let Ω={(x,y):x>0, y>0, x+y<1} be the open reference triangle with its one-cell mesh, let k≥1, and take u(x,y)=x, f=0, and g=u∣∂Ω. Then the weak Nitsche equations have uh0=uh1=u whenever the penalty is above the corresponding coercivity threshold. The same u is the exactly representable strongly imposed P1 solution.

The faces are F1={y=0}, F2={x=0}, and F3={x+y=1}. The arrows are their outward unit normals; the exact boundary fluxes are 0, −1, and 1/2, respectively.

(0;0)(1;0)(0;1)nF1=(0;¡1)nF2=(¡1;0)nF3=(1;1)=p2

Facts & Assumptions

Given: Countable Choice; the reference triangle, u=x, f=0, g=u∣∂Ω, and a degree-k conforming polynomial space; the form definitions Symmetric and nonsymmetric Nitsche boundary forms; and the affine simplex Gauss–Green formula Gauss–Green formula on an affine simplex.

[F1]

For u=x, ∇u=(1,0), Δu=0, and the boundary normal derivative is ∂nu=n1 on each straight facet.

[F2]

If K is a nondegenerate affine simplex and G∈C1(K‾;Rd), then ∫Kdiv⁡G dx=∑F⊂∂K∫FG⋅nK,F dS (Gauss–Green formula on an affine simplex).

[F3]

Above the stated threshold, each form is coercive (Nitsche coercivity above the inverse-trace threshold).

[F4]

A function that is polynomial on each cell and belongs to H01(Ω) has zero classical boundary restriction on every boundary facet (Zero facet traces of functions in H1_0 on an affine mesh).

Verification

Given: The one-cell triangle and the data in [F1]–[F3].

1.1F1F2given

The function u=x is affine, hence belongs to Vh for every k≥1, and it has the prescribed trace g. Apply [F2] to G=wh∇u: since Δu=0, its divergence is ∇wh⋅∇u, and its boundary flux is wh∂nu. Thus the volume term in ah0(u,wh) cancels its first boundary-flux term. The remaining term is γ0∑FhF−1∫Fgwh, exactly ℓh0(wh) because f=0.

2.1F1F2F3F4step 1.1algebra∎

For θ=1, the extra form term is −∑F∫Fu ∂nwh, and the extra load term is −∑F∫Fg ∂nwh; these agree since u∣F=g. Thus u satisfies both weak equations. Coercivity [F3] implies uniqueness: the difference dh of two solutions obeys ahθ(dh,wh)=0 for every wh, so testing wh=dh gives λθ∥dh∥E,h2≤0 and hence dh=0. Therefore uh0=uh1=u. For strong imposition, u∈Vh has the required boundary trace and satisfies the Poisson weak equation on each test in Yh: the simplex Green identity [F2] and the zero boundary restriction [F4] make its boundary flux term vanish. Thus it is the strong Galerkin solution as well.

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passOpen item page →

Penalties below and above the Nitsche coercivity threshold

Example

Assume Countable Choice and take any nondegenerate bounded simplex with its one-cell matching mesh and degree-k space, k≥1. For either Nitsche sign θ∈{0,1}, the algebraic penalty-free boundary form, obtained by evaluating the displayed formula at zero penalty, is not coercive: the constant function has zero gradient and zero form value but positive boundary part in ∥⋅∥E,h. In contrast, any γ0>(1+θ)2C∂2/4 satisfies the sufficient coercivity threshold of Nitsche coercivity above the inverse-trace threshold. The example shows failure at zero and success above the proved bound; it does not claim that every positive penalty below that sufficient bound fails on every mesh.

Facts & Assumptions

Given: Countable Choice; one bounded simplex with all facets boundary; k≥1; a constant trial function; the form and energy seminorm of Symmetric and nonsymmetric Nitsche boundary forms; and the coercivity result Nitsche coercivity above the inverse-trace threshold.

[F1]

At γ0=0, ahθ(1,1)=0 because ∇1=0 and ∂n1=0; the energy seminorm has ∥1∥E,h2=∑FhF−1∣F∣>0 (Symmetric and nonsymmetric Nitsche boundary forms).

[F2]

If γ0>(1+θ)2C∂2/4, then ahθ(vh,vh)≥λθ∥vh∥E,h2 with λθ>0 (Nitsche coercivity above the inverse-trace threshold).

Verification

Given: The one-cell simplex setup and the data in [F1]–[F2].

1.1F1given

For vh=1, each volume-gradient and normal-flux term in the definition vanishes. At γ0=0 the penalty term vanishes too, so ahθ(1,1)=0. Since each facet has positive measure and hF>0, the finite sum ∑FhF−1∣F∣ is positive; hence no positive coercivity constant can bound this form below by ∥1∥E,h2.

2.1F2step 1.1algebra∎

For any γ0 strictly above the displayed threshold, [F2] gives the positive constant λθ and proves coercivity on the entire finite-element space, including the constant function. This establishes the stated below/above comparison without making a necessity claim for intermediate positive penalties.

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

Symmetric cancellation and the nonsymmetric L2 boundary defect

Example

Assume Countable Choice. On the unit reference triangle, the affine function v(x,y)=x gives a finite witness that the symmetric form contains an extra adjoint-consistency term: ah1(v,v)−ah0(v,v)=−∫∂Ωv∂nv=−1/2. In the duality calculation for an error e and a zero-trace adjoint solution ζe, that same term cancels the boundary flux in the symmetric L2 identity. It is absent from the nonsymmetric form, which leaves the separate pairing ∫∂Ωe∂nζe.

Facts & Assumptions

Given: Countable Choice; the unit triangle; v=x; the symmetric and nonsymmetric forms of Symmetric and nonsymmetric Nitsche boundary forms; and an error/adjoint pair in the hypotheses of both L2 theorems, including their stated regularity assumptions.

[F1]

On the diagonal, ah1(v,v)−ah0(v,v)=−∑F∫Fv∂nv by the two form definitions (Symmetric and nonsymmetric Nitsche boundary forms).

[F2]

A function in H01(Ω) has zero boundary-facet trace (Zero facet traces of functions in H1_0 on an affine mesh).

[F3]

Under the exact and adjoint regularity/PDE hypotheses stated in the two L2 theorems, the fractional weak Green supplier proves their Green identities and interior flux cancellation (Fractional weak Green identity and interior flux cancellation).

Verification

Given: The finite triangle calculation and the duality setup in [F3].

1.1F1givenalgebra

The triangle has edges y=0, x=0, and x+y=1. On the first edge ∂nv=0; on the second v=0; on the diagonal n=(1,1)/2, ∂nv=1/2, and the arclength parametrization (t,1−t) has ds=2 dt. Therefore ∑F∫Fv∂nv=∫01t dt=1/2. Substitution in [F1] gives the asserted finite difference −1/2.

2.1F1F2F3givenalgebra∎

For the adjoint Poisson equation, [F3] gives ∥e∥22=∫Ω∇e⋅∇ζe−∑F∫Fe∂nζe. The symmetric form contains the transposed term −∑F∫Fe∂nζe; after subtracting the zero-trace discrete test, the remaining flux is paired with the adjoint interpolation error. The nonsymmetric form has no transposed consistency term; its zero-trace discrete tests satisfy ah0(e,zh)=∫Ω∇e⋅∇zh, leaving the full pairing −∑F∫Fe∂nζe in the error identity. Thus the symmetric method reduces the adjoint boundary defect to an approximation residual, while the nonsymmetric method retains it. The zero boundary traces used here follow from [F2], and the two L2 theorem items retain their distinct hypotheses and rates.

Sources