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

Nitsche consistency and energy quasi-optimality

Statement

Assume Countable Choice and the Poisson/Nitsche setup of Symmetric and nonsymmetric Nitsche boundary forms on a connected bounded polyhedral Ω. Let u∈H1+r(Ω), r>1/2, solve −Δu=f∈L2(Ω) with Dirichlet trace g, and let uhθ solve the discrete problem for θ∈{0,1}. Use the comparison seminorm ∥⋅∥#,h of the definition. Put C∂ as in Global boundary-flux estimate on a matching mesh, and assume γ0>(1+θ)2C∂2/4. The discrete solution exists uniquely, and ∥u−uhθ∥#,h≤Cθinf⁡vh∈Vh∥u−vh∥#,h,Cθ:=1+(2+θC∂+γ0)(1+C∂2)λθ, where λθ is the positive coercivity constant in Nitsche coercivity above the inverse-trace threshold. If, in addition, the Nitsche comparison-norm approximation bound [A2] holds with exponent t>0, then ∥u−uhθ∥#,h≤CθCI(∑K∈ThhK2t∥u∥H1+t(K)2)1/2. The result keeps the weak Dirichlet trace unconstrained in Vh.

Facts & Assumptions

Given: Countable Choice; a finite matching shape-regular affine simplicial mesh of a connected bounded polyhedral domain; the Nitsche forms and mesh-dependent seminorms of Symmetric and nonsymmetric Nitsche boundary forms; u∈H1+r(Ω) with r>1/2; f=−Δu∈L2(Ω); g the trace of u; θ∈{0,1}; and γ0>(1+θ)2C∂2/4.

[F1]

The local restriction-space trace maps Hr(K)→L2(F) exist for r>1/2, so the cellwise normal derivatives of u are defined on all mesh facets (Fractional Bessel-potential traces on simplex facets).

[F2]

The global polynomial flux bound is ∑F∈Fh∂hF∥∂nvh∥F2≤C∂2∥∇vh∥Ω2 (Global boundary-flux estimate on a matching mesh).

[F3]

The discrete form obeys ahθ(vh,vh)≥λθ∥vh∥E,h2 (Nitsche coercivity above the inverse-trace threshold).

[F4]

For the stated u∈H1+r(Ω) with −Δu=f∈L2(Ω) and r>1/2, the fractional weak Green identity holds for every wh∈Vh, with matching interior normal traces (Fractional weak Green identity and interior flux cancellation).

[F5]

Compact subsets of Ω admit smooth cutoffs, smooth multiplication preserves H1, and compactly supported H1 functions extend by zero to H1(Rd). A nonnegative unit-mass smooth bump can be formed by normalizing the bump from A smooth bump between concentric Euclidean balls; the nonnegative C1 change-of-variables formula shows its rescalings have mass and L1 norm one, while their shrinking supports give the tail condition in the definition of an L1 approximate identity. Such families converge in L2, and convolution is smooth and commutes with weak derivatives (Test function cutoffs and euclidean localization, Weak Leibniz rule with a smooth factor, Compactly supported Sobolev functions extend by zero in every integer order, The mollifier family generated by a unit-mass smooth bump, An L1 approximate identity on Rn, A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions, Every L1 approximate identity converges to the identity in Lp for 1≤p<∞, Interior mollification commutes with weak derivatives).

[A2]

For some t>0 and constant CI, the actual affine finite-element family has a Nitsche comparison-norm interpolant satisfying inf⁡vh∈Vh∥u−vh∥#,h≤CI(∑K∈ThhK2t∥u∥H1+t(K)2)1/2. This is a separate approximation hypothesis; it is not inferred from the integer-order local interpolation estimate alone.

Proof

technique · direct coercivity, exact consistency, and finite-dimensional solvability

Given: The data in the Statement and [F4]. The estimate using [A2] is conditional on that separate higher-order/local approximation bound.

1.1F2F3F5givenalgebra

The coercivity threshold in the Statement and [F3] give ahθ(vh,vh)≥λθ∥vh∥E,h2 for all vh∈Vh. If ∥vh∥E,h=0, then the weak gradient of vh is zero. For any ball B with B‾⊂Ω, choose a slightly larger ball B′ still compactly contained in Ω and a smooth cutoff χ∈Cc∞(Ω) equal to one on a neighborhood of B′‾, using [F5]. The product χvh lies in H1(Ω) with compact support by [F5]; let V be its zero extension to Rd. On a neighborhood of B′‾, ∇V=∇vh=0. For sufficiently small ε, [F5] says Vε=ρε∗V is smooth and has gradient ρε∗∇V=0 on B, so it is constant there. The rescaled kernels are an L1 approximate identity, and [F5] gives Vε→V=vh in L2(B); because B has positive measure, the constants Vε∣B are Cauchy and vh is a.e. constant on B. The points polygonally reachable from a fixed point form a nonempty open and relatively closed subset of connected Ω: if a point of Ω is in the relative closure, a small ball in Ω meets the reachable set and its line segment reaches the point. Hence any two points are joined by a polygonal path. A compact polygonal path is covered by a finite chain of overlapping interior balls, so the local constants agree. Thus every point has a neighborhood on which vh equals the same constant c almost everywhere; second countability gives a countable subcover of Ω, and the union of its null exceptional sets is null. On each cell its polynomial agrees a.e. with c on the cell interior and therefore equals c everywhere on the cell; its boundary trace is c. The global flux-bound supplier [F2] guarantees a boundary facet; that facet has positive measure and hF>0, so the zero boundary term in ∥vh∥E,h forces c=0. Thus the energy seminorm is a norm on Vh.

1.2F1F4givenalgebra

The global identity [F4] gives ah0(u,wh)=ℓh0(wh): its volume and first boundary-flux terms equal (f,wh)Ω, and the penalty uses g=u∣∂Ω. For θ=1, the additional term −∑F∫Fu ∂nwh equals the added load term −∑F∫Fg ∂nwh, so ah1(u,wh)=ℓh1(wh) as well. Subtracting the discrete equation yields ahθ(u−uhθ,wh)=0 for all wh∈Vh.

1.3F2F3givenalgebra

For any comparison function z∈Xh and any wh∈Vh, weighted Cauchy–Schwarz bounds the four form terms by ∣ahθ(z,wh)∣≤(2+θC∂+γ0)∥z∥#,h∥wh∥#,h. Here the first flux term uses the flux component of ∥z∥#,h and the boundary-value component of ∥wh∥#,h; the transposed flux uses [F2] for wh; the penalty uses the two boundary-value components. Also [F2] gives ∥wh∥#,h2≤(1+C∂2)∥wh∥E,h2, so [F3] implies ahθ(wh,wh)≥αθ∥wh∥#,h2 with αθ:=λθ/(1+C∂2).

2.1F3step 1.1givenalgebra

Define the linear map Ah:Vh→Vh∗ by (Ahvh)(wh)=ahθ(vh,wh). If Ahvh=0, testing with vh and using [F3] gives λθ∥vh∥E,h2≤0, hence vh=0 by step 1.1. Therefore Ah is injective; since Vh and its dual are finite-dimensional with equal dimension, Ah is bijective. The load ℓhθ is a finite linear functional on Vh, so the discrete equation has a unique solution.

3.1step 1.2step 1.3A2algebra∎

Fix vh∈Vh and set wh:=uhθ−vh. Step 1.2 gives ahθ(wh,wh)=ahθ(u−vh,wh). By step 1.3, if wh≠0 then ∥wh∥#,h≤(2+θC∂+γ0)(1+C∂2)λθ∥u−vh∥#,h; if wh=0 the same inequality is immediate. The triangle inequality and infimum over vh prove the displayed quasi-optimal estimate. If [A2] holds, substituting its right-hand side proves the stated conditional rate.

Source notes

Guermond's Chapter 37 proves this route through its consistency lemma, coercivity lemma, and second Strang estimate. The direct comparison argument above spells out the zero-residual finite-dimensional step for a nonzero boundary lift. The local fractional weak Green supplier proves the conormal identity for the full stated r>1/2 range. The higher-order/local approximation consequence [A2] remains a separate explicit premise; the new P1 zero-boundary theorem supplies the specific dual interpolation branch used by the L2 estimates but does not replace [A2].

Depends on

Used by

Dependency tree · two levels

74 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