Alphabeta Math
TheoremStatement: 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.

Falk error bound for nodal Signorini contact

Statement

Assume the contact model and nodal scheme above, with Kh⊆K, the exact restrictions of a,F to Vh, and shape-regular boundary-conforming meshes. Let u∈K and uh∈Kh solve their continuous and discrete variational inequalities, respectively. Put α=2μ/cK2, M=2μ+2λ, and ηfeas(vh):=a(u,vh−u)−F(vh−u)(vh∈Kh). Then ηfeas(vh)≥0 and ∥u−uh∥V2≤inf⁡vh∈Kh{M2α2∥u−vh∥V2+2αηfeas(vh)}. The term ηfeas is the explicit feasible-comparison defect; the form and load have no quadrature or geometry perturbation here. If additionally u∈H2(Ω;R2)∩C(Ω‾;R2), the obstacle is convex as required by Conforming nodal P1 Signorini contact discretization, the meshes are uniformly shape regular with h→0, then Ihu∈Kh, ∥u−Ihu∥V→0, ηfeas(Ihu)→0, and consequently uh→u in V.

Facts & Assumptions

Given: The continuous solution u∈K, a conforming P1 mesh family, the nodal feasible set Kh⊂K, and the restricted discrete problem on Vh.

[A1]

Countable Choice is used by the continuous and finite-dimensional Stampacchia existence theorems. (The Axiom of Countable Choice (ACω))

[A2]

The Axiom of Choice is used by the Lagrange nodal boundedness branch of the local P1 interpolation theorem. (The Axiom of Choice, Local interpolation estimates on shape-regular affine meshes)

[F1]

The continuous solution satisfies a(u,z−u)≥F(z−u) for every z∈K. (Continuous frictionless elasticity contact is well posed)

[F2]

Vh is finite dimensional, hence Hilbert with the inherited H1 inner product; Kh is nonempty, closed and convex. (Conforming nodal P1 Signorini contact discretization, The convex-obstacle nodal set is conforming, Every finite-dimensional normed space is Banach)

[F3]

The restrictions of a and F are bounded on Vh, and a(vh,vh)≥α∥vh∥V2. (The isotropic contact elasticity form is well defined and bounded, Korn coercivity with a partial Dirichlet segment)

[F4]

A bounded coercive bilinear form on a Hilbert space and a nonempty closed convex set have a unique variational-inequality solution under Countable Choice. (Stampacchia's variational inequality)

[F5]

On the reference triangle S^2 with vertices 0,e1,e2, the affine barycentric functions ϕ^0=1−x^1−x^2, ϕ^1=x^1, and ϕ^2=x^2 satisfy p=∑i=02p(a^i)ϕ^i for every p∈P1, so the three vertex evaluations are unisolvent and define the P1 Lagrange interpolant. The local interpolation theorem, applied with d=2, p=2, k=1, r=ℓ=2, and m∈{0,1}, gives ∣v−IKv∣Wm,2(K)≤ChK2−m∣v∣H2(K): its Axiom of Choice branch supplies boundedness of the vertex evaluations because 2>d/p=1. Apply the scalar estimate componentwise to vector fields, absorbing the fixed two-component norm factor into C; the local and global nodal interpolants agree because affine polynomials are determined by their three vertex values. (Local interpolation estimates on shape-regular affine meshes, Matching affine simplicial meshes and shape regularity, Reference finite elements and unisolvent degrees of freedom, The Axiom of Choice)

[F6]

On a matching mesh, cell interiors are disjoint and the mesh fills the polygon; the finite union of straight edges has planar measure zero. (Matching affine simplicial meshes and shape regularity)

Proof

technique · direct

Given: The continuous VI solution u, the exact-form discrete VI solution uh, Kh⊆K, coercivity constant α>0, and form bound M.

1.1A1F1F2F3F4givenalgebra

By [F2]–[F4], the discrete VI on Vh has a unique solution uh. Fix any vh∈Kh. Since Kh⊆K, [F1] applies at z=uh and gives a(u,uh−u)≥F(uh−u); equivalently a(u,e)≤F(e) for e:=u−uh. The discrete inequality tested at vh gives a(uh,e−δ)≥F(e−δ) for δ:=u−vh. Rearranging these two inequalities yields a(e,e)≤F(δ)−a(uh,δ)=ηfeas(vh)+a(e,δ); [F1] also gives ηfeas(vh)≥0.

1.2A2F2F5F6givenconstruct

For the convergence clause, let vh=Ihu. By [F2] the nodal interpolant belongs to Kh. Apply [F5] on each cell for m=0,1. The cell interiors partition Ω up to the finite edge union [F6]; summing the squared local estimates gives ∥u−Ihu∥V≤C(h+h2)∣u∣H2(Ω)→0.

2.1F3step 1.1algebra

By [F3], α∥e∥V2≤a(e,e) and ∣a(e,δ)∣≤M∥e∥V∥δ∥V. The inequality of step 1.1 and M∥e∥∥δ∥≤(α/2)∥e∥2+(M2/(2α))∥δ∥2 imply ∥e∥V2≤(2/α)ηfeas(vh)+(M2/α2)∥u−vh∥V2. Since vh was arbitrary, take the infimum to obtain the displayed Falk bound.

3.1F1F3step 1.2step 2.1algebra∎

The functional R(v):=a(u,v)−F(v) is bounded on V, with ∥R∥V∗≤M∥u∥V+∥F∥V∗ by [F3]. Thus 0≤ηfeas(Ihu)=R(Ihu−u)≤(M∥u∥+∥F∥)∥Ihu−u∥V→0. Substitute vh=Ihu in step 2.1 and use step 1.2 to conclude ∥u−uh∥V→0.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

59 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