Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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 (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~.

Depends on

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