Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6.1-sol)
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 n≥1, and let Ω⊆Rn be a bounded open set of one of the following two kinds (Bounded C^k domains and boundary charts).

Trace conventions. If n=1, then Ω=(a,b) is a bounded interval and T is the endpoint-pair trace of Endpoint trace commutes with Sobolev truncation on an interval, ordered componentwise. If n≥2, then Ω⊂Rn is a bounded C1 domain and T is the trace operator of The Lp trace operator on a bounded C1 domain. An obstacle is a real function ψ with ψ∈H1(Ω;R) (The notation Hk and the reserved zero-boundary symbol, Integer-order Sobolev spaces and their norms) such that Tψ≤0 — componentwise at the two endpoints when n=1, and almost everywhere on ∂Ω when n≥2. By Endpoint trace commutes with Sobolev truncation on an interval for n=1 and A function whose trace is at most a level has positive part in the zero-boundary space for n≥2, this boundary order condition is equivalent to ψ+∈H01(Ω).

The obstacle admissible set is K:={ v∈H01(Ω;R):v≥ψ a.e. on Ω }, where the inequality v≥ψ is imposed on almost-everywhere classes and is therefore independent of the chosen representatives (The space Lp(μ) as the quotient by null functions, Zero-boundary Sobolev space as a norm closure).

Data. Let a:H01(Ω)×H01(Ω)→R be a bounded coercive bilinear form with constants M,α>0 (Bounded, coercive and symmetric sesquilinear forms) and let F∈H−1(Ω) (The negative Sobolev space H−1(Ω)).

The obstacle variational inequality is the problem: find u∈K with a(u, v−u)≥F(v−u)for every v∈K.

Energy and reaction. In the symmetric case the associated energy is J(v):=12a(v,v)−F(v) for v∈H01(Ω); the reaction distribution of a solution u is the distribution on Ω defined by Λu(φ):=a(u,φ)−F(φ)(φ∈Cc∞(Ω)), the right-hand side being well defined on real test functions because Cc∞(Ω;R)⊆H01(Ω;R) (Test function space d of an open set). It is linear and continuous: boundedness gives ∣Λu(φ)∣≤(M∥u∥H1+∥F∥H−1)∥φ∥H1, and for tests supported in a compact S⊆Ω, ∥φ∥H1≤(n+1)∣S∣max⁡∣α∣≤1∥Dαφ∥∞. Thus ∣Λu∣ is a seminorm continuous on every fixed-support test space and hence continuous for Test function topology. Its complex-linear extension is Λu(φ1+iφ2)=Λu(φ1)+iΛu(φ2) for real tests φ1,φ2, giving a distribution in the convention of Distribution; nonnegativity is tested on real nonnegative tests.

Depends on

Used by

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