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.
Variational inequalities and spatial contact discretization — Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Absolute Continuity and the Sharp Fundamental Theorem of Calculus
- Approximation and Compactness in C(K)
- Areas of Elementary Plane Figures
- Banach Valued Integration and the Radon Nikodym Property
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Linear Operators and Quotient Spaces
- Bounded Variation and the Riemann–Stieltjes Integral
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Complex Lp Spaces and Test-Function Conventions
- Complex Norms and Realification
- Complexification, Realification and Real Structures
- Connectedness
- Constrained Variational Problems and Variational Inequalities
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Convexity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Darboux, L'Hôpital, and Taylor's Theorem
- Density Separability and Convolution in Lᵖ
- Determinants of Matrices over a Commutative Ring
- Differentiation of Monotone Functions and the Vitali Covering Theorem
- Distributions Test Functions and Differentiation
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Dual Spaces Adjoint Operators and Annihilators
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Euclidean Surface Measure, Divergence, and Green Identities
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Dimensional Normed Spaces and Riesz Lemma
- Finite Probability and the Probabilistic Method
- Finite-element meshes and interpolation
- Foundations of the Real Numbers for Analysis
- Fourier Multipliers and Sobolev Characterisations
- Fourier Transform Convolution and Approximate Identities
- Fredholm Elliptic Problems and the Elliptic Spectrum
- Fubini and Change of Variables
- Fundamental Trigonometric Identities
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Harmonic Functions and Mean Values in Rn
- Hausdorff via the Diagonal
- Hilbert Space Geometry and Riesz Representation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Improper and Parameter-Dependent Multiple Integrals
- Improper Integrals
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Interior and Boundary Sobolev Elliptic Regularity
- Lax--Milgram and Weak Elliptic Solutions
- Lebesgue Measure on Euclidean Space
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear elasticity, nearly incompressible limits and locking
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Mixed finite elements and Stokes stability
- Mixed Partials, Taylor Formulae, and Extrema
- Modes of Convergence Egorov and Lusin
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- Norming and Separation under Hahn–Banach
- Order, Zorn's Lemma, and the Axiom of Choice
- Orthonormal Bases, Parseval and Fourier Series
- Outer Measure and the Caratheodory Extension Theorem
- Pointwise Extended-Real Function Products
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Radon Measures and the Riesz Markov Kakutani Theorem
- Relations, Functions, and Quotients
- Rellich Kondrachov and Sobolev Compactness
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Schwartz Space and the Plancherel Theorem
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Signed and Complex Measures Hahn and Jordan
- Simple Field Extensions and the Construction of the Complex Numbers
- Sine, Cosine, and the Definition of Pi
- Smooth Approximation and Sobolev Extension
- Smooth Manifolds and Smooth Maps
- Smooth Partitions of Unity and Exhaustions
- Sobolev Poincare and Morrey Inequalities
- Sobolev Traces and Zero Boundary Values
- Subspaces, Products, and Quotients
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- Tangent Cotangent and the Differential
- Tempered Distributions and the Fourier Transform
- The Analytic Hahn Banach Theorem
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Exponential Function
- The Fundamental Theorems of Calculus
- The Inverse and Implicit Function Theorems
- The Inverse Function Theorem Completed
- The Lebesgue and Riemann Integrals Compared
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- The Maximal Function and Lebesgue Differentiation
- The Radon Nikodym Theorem and Lebesgue Decomposition
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Variational inequalities and spatial contact discretization
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Weak Derivatives and Sobolev Spaces
- Weak Elliptic Maximum Principles and Holder Regularity
2 · Summary
These examples make the contact conventions concrete and mark the limits of the discretization claims.
- A one-dimensional obstacle with an explicit free boundary verifies a scalar obstacle solution, its free boundary, and its nonnegative reaction density directly.
- Nodal feasibility can miss a nonconvex obstacle between vertices shows how nodal constraints can miss a concave obstacle between contact vertices.
- An affine shear field passes the frictionless contact patch test gives an exactly represented affine shear with zero contact gap and a manufactured load whose continuous and nodal solutions coincide.
- A two-gap contact model changes its active set with the load solves two reduced complementarity systems and tracks the load-dependent active constraint. The chosen matrix is an algebraic example, not a claimed geometric finite element stiffness matrix.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
A one-dimensional obstacle with an explicit free boundary
Statement
On take , obstacle for and for , bilinear form , and load , where Then is the unique solution of the scalar obstacle variational inequality. Using the displayed continuous representatives on , their coincidence set on is ; the contact set within is . The reaction density is on and on .
Facts & Assumptions
Given: The interval , the obstacle convention and variational inequality of The closed convex obstacle set and the obstacle variational inequality, and the data above.
Countable Choice is assumed by the one-dimensional Poincare inequality. (The Axiom of Countable Choice ())
The Axiom of Choice is assumed by the published obstacle and endpoint-trace interfaces. (The Axiom of Choice)
In dimension one the obstacle definition takes , requires and nonpositive endpoint traces, and sets . (The closed convex obstacle set and the obstacle variational inequality)
On an interval, the endpoint-pair trace is given by the continuous absolutely continuous representative, and its kernel is . (Endpoint trace commutes with Sobolev truncation on an interval)
On , the derivative seminorm controls the full norm by the one-dimensional Poincare inequality. (The Poincare inequality for zero-boundary Sobolev closures on domains bounded in one direction)
The integral pairing of two functions is bounded by the product of their norms. (Cauchy-Schwarz inequality for )
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)
is the closure of . (Zero-boundary Sobolev space as a norm closure)
Proof
The function is continuous and piecewise affine, hence belongs to ; its endpoint values are and , so [F1] applies. The displayed is continuous at , has derivative from both sides there, and has endpoint values . By [F2], its endpoint trace is zero and therefore . On , ; on , . Thus , and equality holds exactly on .
On , direct differentiation gives ; on , . The derivative is continuous at , so its distributional derivative is the piecewise function just computed, with no point mass at . For , [F6] supplies a sequence converging in . Piecewise integration by parts for each has cancelling interface terms because is continuous; passing to the limit in the pairings gives . Since on the first interval and on the second, this yields , where the last inequality uses almost everywhere on . Hence solves the variational inequality. The same integration by parts against compactly supported tests gives reaction density on and on ; no point mass occurs at because is continuous.
The function is bounded on both subintervals, hence belongs to . The form is symmetric and bounded since by [F4]. By [F3], for some . Thus the form is bounded, symmetric and coercive in the sense of [F5]. The load is bounded because by [F3]–[F4]. If is another solution, test its inequality with and the one for with , then add; symmetry gives . Coercivity forces .
Nodal feasibility can miss a nonconvex obstacle between vertices
Statement
Let , , , and . Use the grid , and split each rectangular cell by a diagonal. This is a matching triangular mesh on which both segments are single boundary edges. Parameterize by normalized arclength , set , and let . The obstacle is continuous, nonpositive and concave, and satisfies both endpoint nodal inequalities, but 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.
The nodal constraints require at each contact vertex; the continuum feasible set requires almost everywhere on the whole contact segment. (Conforming nodal P1 Signorini contact discretization, The vector Signorini contact set and variational inequality)
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
The polynomial has endpoint values and midpoint value , and shows its maximum is . For and , direct expansion gives , with strict inequality when and . Thus [F2] says is strictly concave, not convex, and the convex-obstacle premise is absent.
The vector field is affine on each triangle and is zero on , hence belongs to . On the two contact vertices its normal value is , equal to the endpoint obstacle values, so both nodal inequalities hold. Along all of , , while at the obstacle equals ; continuity gives an interval around that midpoint on which . Therefore the continuum contact inequality fails on a set of positive arclength and .
An affine shear field passes the frictionless contact patch test
Statement
On the unit square with , , and , use any matching boundary-conforming affine triangular mesh that resolves both segments as unions of boundary edges, and take obstacle . Let and define the load on . Then 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.
Countable Choice is used by the imported continuous and discrete Stampacchia theorems. (The Axiom of Countable Choice ())
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)
consists of vector fields with zero Dirichlet trace, and is the isotropic symmetric-strain elasticity form. (Small-strain elasticity with a frictionless contact gap)
The feasible set is and the nodal scheme defines finite-dimensional and a nonempty closed convex set . (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)
The elasticity form is bounded by and coercive by on . (The isotropic contact elasticity form is well defined and bounded, Korn coercivity with a partial Dirichlet segment)
The continuous VI has a unique solution. (Continuous frictionless elasticity contact is well posed)
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
The affine field lies in and vanishes on the left side, so . On the right side , hence and has zero gap. Every affine function restricts to a continuous piecewise-affine function on the given matching mesh, so ; its contact nodal inequalities hold with equality, so .
The gradient is , so and . By [F3], is bounded. For every , , so solves the continuous VI; uniqueness follows from [F4]. For every , the same identity holds, so solves the discrete VI. The inherited inner product makes finite-dimensional a Hilbert space by [F2]; the restricted form is bounded and coercive by [F3], and [F5] gives uniqueness.
A two-gap contact model changes its active set with the load
Statement
Consider the reduced two-gap variational inequality with stiffness : for a load , find such that for every . Its complementarity form is , , , and . The scaling matches The dual mortar contact system is stable and exactly complementary, where is the diagonal dual-pair weight and is the multiplier coefficient. For , both gaps are positive and no constraint is active. For , the second constraint alone is active, with and . 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 above.
The mortar stationarity pairs nodal reactions 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
The vectors and are eigenvectors of with eigenvalues and , so is symmetric positive definite. Also . For , the unconstrained solution is , which has positive entries, and . Thus every VI test has zero residual and the complementarity equations hold with . The scaling between and the mortar coefficient agrees with [F1].
For , take and compute , so . Both vectors are componentwise nonnegative and . For every , , so this is the VI solution with exactly the second gap active.
Let be the standard coordinate vectors and write . If , , and , then for every , , so the complementarity equations imply the VI. Conversely, suppose solves the VI. If , choose and test with and ; the two inequalities give and , hence . If , test with for any to get . Thus and for both coordinates, proving equivalence. If both solve the VI for the same load, testing with each other and adding gives . The eigenvalues computed in step 1.1 are positive, so is positive definite and this forces ; then is also unique. Thus the displayed complementarity solutions are the unique ones for their respective loads.
Sources
- John Andersson, The Obstacle Problem, complete 52-page KTH lecture notes
- Richard S. Falk, Error Estimates for the Approximation of a Class of Variational Inequalities, complete 10-page paper
- Jean-Luc Guermond, MATH 661 Fall 2025, Part XI Chapter 53: Stokes equations: Basic ideas
- Walter Zulehner, Numerical Methods for Continuum Mechanics 1, complete 80-page lecture notes
- Rolf H. Krause and Barbara I. Wohlmuth, Multigrid Methods for Mortar Finite Elements, complete 7-page paper