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

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.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

24 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