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.
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 .
Depends on
- The closed convex obstacle set and the obstacle variational inequality
- Endpoint trace commutes with Sobolev truncation on an interval
- The Poincare inequality for zero-boundary Sobolev closures on domains bounded in one direction
- Cauchy-Schwarz inequality for $L^2$
- Bounded, coercive and symmetric sesquilinear forms
- Zero-boundary Sobolev space as a norm closure
- The Axiom of Choice
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
54 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, complete 52-page KTH lecture notes (standard reference, not scraped)
- Richard S. Falk, Error Estimates for the Approximation of a Class of Variational Inequalities, complete 10-page paper (standard reference, not scraped)