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.

✓ 4 results · all verified · 1 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 3 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Variational inequalities and spatial contact discretization — Examples

1 · Prerequisites

2 · Summary

These examples make the contact conventions concrete and mark the limits of the discretization claims.

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 →

A one-dimensional obstacle with an explicit free boundary

Statement

On (0,1) take a0=1/2, obstacle ψ(x)=0 for 0≤x≤a0 and ψ(x)=−(x−a0) for a0≤x≤1, bilinear form a(w,z)=∫01w′z′ dx, and load F(z)=∫01fz dx, where u(x)={0,0≤x≤a0,(x−a0)2(1−x),a0≤x≤1,f(x)={−1,0<x<a0,−4+6x,a0<x<1. Then u is the unique solution of the scalar obstacle variational inequality. Using the displayed continuous representatives on [0,1], their coincidence set on Ω‾ is [0,a0]; the contact set within Ω=(0,1) is (0,a0]. The reaction density is 1 on (0,a0) and 0 on (a0,1).

Facts & Assumptions

Given: The interval (0,1), the obstacle convention and variational inequality of The closed convex obstacle set and the obstacle variational inequality, and the data above.

[A1]

Countable Choice is assumed by the one-dimensional Poincare inequality. (The Axiom of Countable Choice (ACω))

[A2]

The Axiom of Choice is assumed by the published obstacle and endpoint-trace interfaces. (The Axiom of Choice)

[F1]

In dimension one the obstacle definition takes Ω=(0,1), requires ψ∈H1(0,1) and nonpositive endpoint traces, and sets K={v∈H01(0,1):v≥ψ a.e.}. (The closed convex obstacle set and the obstacle variational inequality)

[F2]

On an interval, the endpoint-pair trace is given by the continuous absolutely continuous representative, and its kernel is H01(0,1). (Endpoint trace commutes with Sobolev truncation on an interval)

[F3]

On H01(0,1), the derivative seminorm controls the full H1 norm by the one-dimensional Poincare inequality. (The Poincare inequality for zero-boundary Sobolev closures on domains bounded in one direction)

[F4]

The integral pairing of two L2(0,1) functions is bounded by the product of their L2 norms. (Cauchy-Schwarz inequality for L2)

[F5]

A bounded coercive symmetric bilinear form is bounded in the specified norm and satisfies a positive quadratic lower bound. (Bounded, coercive and symmetric sesquilinear forms)

[F6]

H01(0,1) is the H1 closure of Cc∞(0,1). (Zero-boundary Sobolev space as a norm closure)

Proof

1.1A2F1F2givenalgebra

The function ψ is continuous and piecewise affine, hence belongs to H1(0,1); its endpoint values are 0 and −1/2, so [F1] applies. The displayed u is continuous at a0, has derivative 0 from both sides there, and has endpoint values u(0)=u(1)=0. By [F2], its endpoint trace is zero and therefore u∈H01(0,1). On [0,a0], u=ψ=0; on (a0,1], u≥0>ψ. Thus u∈K, and equality u=ψ holds exactly on [0,a0].

1.2F1F6givenalgebra

On (a0,1), direct differentiation gives u′′(x)=4−6x; on (0,a0), u′′=0. The derivative u′ is continuous at a0, so its distributional derivative is the piecewise function just computed, with no point mass at a0. For z=v−u∈H01(0,1), [F6] supplies a sequence zm∈Cc∞(0,1) converging in H1. Piecewise integration by parts for each zm has cancelling interface terms because u′ is continuous; passing to the limit in the L2 pairings gives ∫01u′z′=−∫01u′′z. Since f=−1 on the first interval and f=−u′′ on the second, this yields a(u,v−u)−F(v−u)=∫0a0(v−u) dx=∫0a0v dx≥0, where the last inequality uses v≥ψ=0 almost everywhere on (0,a0). Hence u solves the variational inequality. The same integration by parts against compactly supported tests gives reaction density −u′′−f=1 on (0,a0) and 0 on (a0,1); no point mass occurs at a0 because u′ is continuous.

2.1A1A2F3F4F5step 1.2algebra∎

The function f is bounded on both subintervals, hence belongs to L2(0,1). The form is symmetric and bounded since ∣a(w,z)∣≤∥w′∥2∥z′∥2≤∥w∥H1∥z∥H1 by [F4]. By [F3], a(w,w)=∥w′∥22≥cP−2∥w∥H12 for some cP>0. Thus the form is bounded, symmetric and coercive in the sense of [F5]. The load is bounded because ∣F(z)∣≤∥f∥2∥z∥2≤cP∥f∥2∥z∥H1 by [F3]–[F4]. If u~∈K is another solution, test its inequality with u and the one for u with u~, then add; symmetry gives a(u−u~,u−u~)≤0. Coercivity forces u=u~.

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

Nodal feasibility can miss a nonconvex obstacle between vertices

Statement

Let Ω=(0,1)2, ΓD={0}×[1/4,3/4], ΓC={1}×[1/4,3/4], and n=(1,0). Use the grid x∈{0,1/2,1}, y∈{0,1/4,3/4,1} and split each rectangular cell by a diagonal. This is a matching triangular mesh on which both segments are single boundary edges. Parameterize ΓC by normalized arclength s=2(y−1/4)∈[0,1], set ψ(s)=−1+4s(1−s), and let vh(x,y)=(−x,0). The obstacle is continuous, nonpositive and concave, and vh satisfies both endpoint nodal inequalities, but vh∉K because its contact gap is negative at the midpoint.

Facts & Assumptions

Given: The nodal scheme Conforming nodal P1 Signorini contact discretization except that its convexity hypothesis on ψ is removed for this counterexample.

[F1]

The nodal constraints require vh(a)⋅n≥Ihψ(a) at each contact vertex; the continuum feasible set requires TCvh⋅n≥ψ almost everywhere on the whole contact segment. (Conforming nodal P1 Signorini contact discretization, The vector Signorini contact set and variational inequality)

[F2]

A real function is concave on an interval when its negative is convex there, with convexity defined by the chord inequality. (Convex, strictly convex, concave, strictly concave, and midpoint-convex real functions on an interval)

Proof

1.1F1F2givenalgebra

The polynomial ψ(s)=−1+4s(1−s) has endpoint values −1 and midpoint value 0, and ψ(s)=−(2s−1)2 shows its maximum is 0. For s0,s1∈[0,1] and t∈[0,1], direct expansion gives ψ((1−t)s0+ts1)−[(1−t)ψ(s0)+tψ(s1)]=4t(1−t)(s1−s0)2≥0, with strict inequality when 0<t<1 and s0≠s1. Thus [F2] says ψ is strictly concave, not convex, and the convex-obstacle premise is absent.

2.1F1givenalgebra∎

The vector field vh(x,y)=(−x,0) is affine on each triangle and is zero on ΓD, hence belongs to Vh. On the two contact vertices its normal value is −1, equal to the endpoint obstacle values, so both nodal inequalities hold. Along all of ΓC, vh⋅n=−1, while at s=1/2 the obstacle equals 0; continuity gives an interval around that midpoint on which −1<ψ(s). Therefore the continuum contact inequality fails on a set of positive arclength and vh∉K.

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

An affine shear field passes the frictionless contact patch test

Statement

On the unit square with ΓD={0}×[1/4,3/4], ΓC={1}×[1/4,3/4], and n=(1,0), use any matching boundary-conforming affine triangular mesh that resolves both segments as unions of boundary edges, and take obstacle ψ=0. Let u(x,y)=(0,x) and define the load F(v)=a(u,v) on V. Then u is the unique continuous solution and, on every such mesh, the same field is the unique nodal P1 solution. Its contact gap is identically zero.

Facts & Assumptions

Given: The elasticity and Signorini conventions of Small-strain elasticity with a frictionless contact gap and The vector Signorini contact set and variational inequality, with the square and boundary segments above.

[A1]

Countable Choice is used by the imported continuous and discrete Stampacchia theorems. (The Axiom of Countable Choice (ACω))

[A2]

The Axiom of Choice is inherited by the trace and partial-boundary Korn interfaces in the continuous well-posedness theorem. (The Axiom of Choice, Continuous frictionless elasticity contact is well posed)

[F1]

V consists of H1 vector fields with zero Dirichlet trace, and a is the isotropic symmetric-strain elasticity form. (Small-strain elasticity with a frictionless contact gap)

[F2]

The feasible set is K={v∈V:TCv⋅n≥ψ} and the nodal scheme defines finite-dimensional Vh and a nonempty closed convex set Kh⊆K. (The vector Signorini contact set and variational inequality, Conforming nodal P1 Signorini contact discretization, Broken and conforming polynomial spaces on a matching mesh, Every finite-dimensional normed space is Banach, The convex-obstacle nodal set is conforming)

[F3]
[F4]

The continuous VI has a unique solution. (Continuous frictionless elasticity contact is well posed)

[F5]

On a Hilbert space, a nonempty closed convex set and bounded coercive form yield a unique VI solution under Countable Choice. (Stampacchia's variational inequality)

Proof

1.1F1F2givenalgebra

The affine field u lies in H1(Ω;R2) and vanishes on the left side, so u∈V. On the right side u⋅n=0=ψ, hence u∈K and has zero gap. Every affine function restricts to a continuous piecewise-affine function on the given matching mesh, so u∈Vh; its contact nodal inequalities hold with equality, so u∈Kh.

2.1A1A2F2F3F4F5step 1.1algebra∎

The gradient is ∇u=(0010), so div⁡u=0 and ε(u)=(01/21/20). By [F3], F(v)=a(u,v) is bounded. For every v∈K, a(u,v−u)−F(v−u)=0, so u solves the continuous VI; uniqueness follows from [F4]. For every vh∈Kh⊆K, the same identity holds, so u solves the discrete VI. The inherited H1 inner product makes finite-dimensional Vh a Hilbert space by [F2]; the restricted form is bounded and coercive by [F3], and [F5] gives uniqueness.

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

A two-gap contact model changes its active set with the load

Statement

Consider the reduced two-gap variational inequality with stiffness A=(2−1−12): for a load f∈R2, find g∈R+2 such that (Ag−f)⋅(z−g)≥0 for every z∈R+2. Its complementarity form is Ag−f=ρ, gi≥0, ρi≥0, and ρigi=0. The scaling ρi=diλi matches The dual mortar contact system is stable and exactly complementary, where di>0 is the diagonal dual-pair weight and λi is the multiplier coefficient. For f(1)=(1,1/5)T, both gaps are positive and no constraint is active. For f(2)=(1,−1)T, the second constraint alone is active, with g=(1/2,0)T and ρ=(0,1/2)T. This is an algebraic reduced model; the chosen matrix is not asserted to arise from a particular geometric mesh.

Facts & Assumptions

Given: The complementarity sign convention of The dual mortar contact system is stable and exactly complementary and the matrix A above.

[F1]

The mortar stationarity pairs nodal reactions diλi with the corresponding gap coordinates, and each coefficient and gap is nonnegative with zero product. (The dual mortar contact system is stable and exactly complementary)

Proof

1.1F1givenalgebra

The vectors (1,1)T and (1,−1)T are eigenvectors of A with eigenvalues 1 and 3, so A is symmetric positive definite. Also A−1=13(2112). For f(1)=(1,1/5)T, the unconstrained solution is g=A−1f(1)=(11/15,7/15)T, which has positive entries, and Ag−f(1)=0. Thus every VI test has zero residual and the complementarity equations hold with ρ=0. The scaling between ρi and the mortar coefficient λi agrees with [F1].

1.2givenalgebra

For f(2)=(1,−1)T, take g=(1/2,0)T and compute Ag=(1,−1/2)T, so Ag−f(2)=(0,1/2)T=ρ. Both vectors are componentwise nonnegative and ρ1g1=0=ρ2g2. For every z∈R+2, ρ⋅(z−g)=ρ2z2≥0, so this is the VI solution with exactly the second gap active.

2.1step 1.1step 1.2givenalgebra∎

Let e1,e2 be the standard coordinate vectors and write r:=Ag−f. If g≥0, r≥0, and rigi=0, then for every z≥0, r⋅(z−g)=∑irizi−∑irigi=∑irizi≥0, so the complementarity equations imply the VI. Conversely, suppose g solves the VI. If gi>0, choose 0<t<gi and test with z=g+tei and z=g−tei; the two inequalities give ri≥0 and ri≤0, hence ri=0. If gi=0, test with z=g+tei for any t>0 to get ri≥0. Thus r≥0 and rigi=0 for both coordinates, proving equivalence. If g,g~ both solve the VI for the same load, testing with each other and adding gives −(g−g~)TA(g−g~)≥0. The eigenvalues computed in step 1.1 are positive, so A is positive definite and this forces g=g~; then ρ=Ag−f is also unique. Thus the displayed complementarity solutions are the unique ones for their respective loads.

Sources