Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-generatedPipeline-generated
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 elliptic diffusion coefficient has the adjoint gradient

Example

Let V=H01(0,1) with its standard H1 norm, let Θ=(−1,∞), and define aθ(u,v)=(1+θ)∫01u′v′ dx and ℓ(v)=∫01v dx. Take J(u)=∫01u dx. On a neighborhood of each fixed θ>−1, the form is uniformly coercive in the H1 norm, so this is a parameterized coercive elliptic problem in the sense of Parameter-dependent coercive elliptic variational states and objectives.

Facts & Assumptions

Given: The one-dimensional Sobolev space, the displayed bilinear form/load, and the reduced-gradient formula.

[F1]

For a uniformly coercive parameterized elliptic variational state and C1 objective, the adjoint formula gives Dθj=DθJ+Dθℓ(p)−Dθa(u,p) (The elliptic adjoint gives the reduced parameter gradient).

[F2]

The elliptic variational definition treats states as weak solutions of aθ(u,v)=ℓθ(v) (Parameter-dependent coercive elliptic variational states and objectives).

[F3]

The quadratic w(x)=x(1−x)/2 belongs to H01(0,1) (The two-cell hat and quadratic functions belong to H¹₀).

[F4]

For v∈H01(0,1), ∥v∥H1≤2∥v′∥L2 (Zero-boundary Poincaré inequality on the unit interval).

[F5]

H01(0,1) is the closure of Cc∞(0,1) in the H1 norm (Zero-boundary Sobolev space as a norm closure, Integer-order Sobolev spaces and their norms).

[F8]

The integral pairing is bounded by the product of L2 norms (Holder's inequality for integrals, including the endpoint cases).

[F9]

H01(0,1) with the standard H1 inner product is a real Hilbert space (The Sobolev space H1 is a Hilbert space).

[A1]

Countable Choice is inherited from the state, adjoint, and H0 membership suppliers (The Axiom of Countable Choice (ACω)).

Verification

1.1A1F2F3F4F5F6F7F8F9givenalgebra

Put w(x)=x(1−x)/2. Direct differentiation gives w′′=−1, w(0)=w(1)=0, and [F3] gives w∈V. By [F9], V is a real Hilbert space. Holder's inequality [F8] gives ∣ℓ(v)∣=∣∫01v∣≤∥1∥L2∥v∥L2≤∥v∥H1, so ℓ∈V∗; the objective J(u,θ)=ℓ(u) is bounded linear in u and independent of θ, hence C1 with DuJ[v]=ℓ(v) and DθJ=0. Also ∣aθ(u,v)∣≤(1+θ)∥u∥H1∥v∥H1 for θ>−1, and Aθ=(1+θ)A0 is operator-norm C1, while ℓθ=ℓ is constant. For each v∈V and ε>0, [F5] supplies vε∈Cc∞(0,1) with ∥v−vε∥H1<ε. By the product rule [F7], (w′vε)′=w′′vε+w′vε′; since vε vanishes at both endpoints, [F6] gives ∫01w′vε′=∫01vε. By [F8], the difference between the two sides with v in place of vε is at most (∥w′∥L2+1)ε, so the weak identity ∫01w′v′=∫01v follows as ε↓0. Also, [F4] gives aθ(v,v)≥(1+θ)∥v∥H12/2; on a neighborhood of each θ>−1 this is a uniform coercivity bound. Hence uθ=w/(1+θ) solves the state equation and is unique. Finally ∫01w=1/12, so j(θ)=1/(12(1+θ)).

2.1A1F1F2F3step 1.1algebra

The adjoint equation is aθ(v,p)=DuJ[v]=∫01v for all v∈V, so symmetry of aθ and uniqueness give p=uθ. The direct parameter derivatives of J and ℓ vanish. For the scalar parameter direction 1, Dθa[1](u,p)=∫01u′p′ dx=(1+θ)−2∫01(w′)2dx. Direct integration gives ∫01(w′)2dx=14∫01(1−2x)2dx=1/12, hence Dθa[1](u,p)=1/(12(1+θ)2).

3.1F1step 1.1step 2.1algebra∎

Formula [F1] therefore gives j′(θ)=−1/(12(1+θ)2), equal to the derivative of the explicit reduced objective in step 1.1.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

76 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