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.
The closed convex obstacle set and the obstacle variational inequality
Definition
Assume the Axiom of Choice (The Axiom of Choice). Let , and let be a bounded open set of one of the following two kinds (Bounded C^k domains and boundary charts).
Trace conventions. If , then is a bounded interval and is the endpoint-pair trace of Endpoint trace commutes with Sobolev truncation on an interval, ordered componentwise. If , then is a bounded domain and is the trace operator of The trace operator on a bounded domain. An obstacle is a real function with (The notation and the reserved zero-boundary symbol, Integer-order Sobolev spaces and their norms) such that — componentwise at the two endpoints when , and almost everywhere on when . By Endpoint trace commutes with Sobolev truncation on an interval for and A function whose trace is at most a level has positive part in the zero-boundary space for , this boundary order condition is equivalent to .
The obstacle admissible set is where the inequality is imposed on almost-everywhere classes and is therefore independent of the chosen representatives (The space as the quotient by null functions, Zero-boundary Sobolev space as a norm closure).
Data. Let be a bounded coercive bilinear form with constants (Bounded, coercive and symmetric sesquilinear forms) and let (The negative Sobolev space ).
The obstacle variational inequality is the problem: find with
Energy and reaction. In the symmetric case the associated energy is for ; the reaction distribution of a solution is the distribution on defined by the right-hand side being well defined on real test functions because (Test function space d of an open set). It is linear and continuous: boundedness gives , and for tests supported in a compact , . Thus is a seminorm continuous on every fixed-support test space and hence continuous for Test function topology. Its complex-linear extension is for real tests , giving a distribution in the convention of Distribution; nonnegativity is tested on real nonnegative tests.
Depends on
- The Axiom of Choice
- Bounded C^k domains and boundary charts
- Bounded, coercive and symmetric sesquilinear forms
- Distribution
- Test function topology
- The negative Sobolev space $H^{-1}(\Omega)$
- The notation $H^k$ and the reserved zero-boundary symbol
- The space $L^p(\mu)$ as the quotient by null functions
- Integer-order Sobolev spaces and their norms
- Test function space d of an open set
- Zero-boundary Sobolev space as a norm closure
- Endpoint trace commutes with Sobolev truncation on an interval
- A function whose trace is at most a level has positive part in the zero-boundary space
- The $L^p$ trace operator on a bounded $C^1$ domain
Used by
- Obstacle complementarity in distribution form Corollary
- The obstacle reaction is supported on the contact set under measure regularity Corollary
- The obstacle admissible set can be empty when trace and obstacle are incompatible Counterexample
- A one-dimensional obstacle problem and its contact set Example
- The obstacle admissible set is nonempty, convex, closed and weakly closed Lemma
- Pointwise and integral constraints have different regularity tests Remark
- Existence and uniqueness for the obstacle problem Theorem
- Lewy–Stampacchia distribution bound for bounded-coefficient obstacle forms Theorem
Dependency tree · two levels
73 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
- John Andersson, The Obstacle Problem, KTH lecture notes, 16 December 2015 (complete 52-page notes) (standard reference, not scraped)
- Gerald Teschl, Partial Differential Equations: From Classical to Modern (2026 author manuscript; complete 392-page archived text) (standard reference, not scraped)