Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge 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 adjoint solution operator solves the adjoint form problem

Statement

Assume Countable Choice. Let Ω⊆Rn be open, μ≥β, and let a∗ be the adjoint form of The formal adjoint and the adjoint weak Dirichlet problem. Define Kμ∗f, for f∈L2(Ω), to be the unique v∈H01(Ω) with aμ∗(v,w)=(f,w)L2 for every w∈H01(Ω) (existence and uniqueness by The Lax--Milgram theorem). Then Kμ∗ is well defined and linear on L2(Ω), and it is the Hilbert-space adjoint of the shifted solution operator Kμ of The shifted elliptic solution operator: (Kμf,g)L2=(f,Kμ∗g)L2for all f,g∈L2(Ω). If Ω is bounded and the Axiom of Choice is also assumed, then Kμ∗ is compact on L2(Ω) (The shifted solution operator is compact on L2 is proved by the same bounded-map/Rellich composition for a∗). Moreover, for v∈L2(Ω) one has v∈ker⁡(I−μKμ∗) if and only if v∈H01(Ω) and a∗(v,w)=0 for every w∈H01(Ω).

Facts & Assumptions

Given: Countable Choice; an open set Ω⊆Rn; the divergence-form operator L, its form a, the adjoint form a∗, a fixed μ≥β, and the operators Kμ,Kμ∗ on L2(Ω).

[F1]

The adjoint form a∗ and its shift: a∗(v,w)=a(w,v)‾, aμ∗=a∗+μ(⋅,⋅)L2, and Re⁡aμ∗(u,u)=Re⁡aμ(u,u)≥θ2∥u∥H012, so aμ∗ is bounded and coercive on H01(Ω) with the same constants as aμ; the datum w↦(f,w)L2 is a bounded conjugate-linear functional on H01(Ω) (The formal adjoint and the adjoint weak Dirichlet problem, The shifted elliptic solution operator, The space Lp(μ) as the quotient by null functions, Zero-boundary Sobolev space as a norm closure).

[F2]

Lax--Milgram: a bounded coercive sesquilinear form on a Hilbert space and a bounded conjugate-linear functional have a unique solution, and the solution map is linear with norm at most 1/α (The Lax--Milgram theorem, A bounded linear operator between normed spaces, Integer-order Sobolev spaces and their norms).

[F3]

Hilbert-space adjoints: S∗ is the operator with (Sf,g)=(f,S∗g) for all f,g, and it is unique (The Hilbert-space adjoint of a bounded operator, Hilbert-adjoint identities).

[F4]

The L2 realization of Kμ is compact when Ω is bounded: a bounded linear map L2(Ω)→H01(Ω) followed by the compact Rellich inclusion H01(Ω)↪L2(Ω) is compact (The shifted solution operator is compact on L2, Compositions with a compact operator are compact, Compactness of W01,p(Ω)↪Lp(Ω) on bounded open sets, Compact linear operator, The Axiom of Choice).

Proof

technique · direct
1.1F1F2given

Well-definedness and linearity. By [F1] and [F2] applied to aμ∗, for each f∈L2(Ω) there is a unique v∈H01(Ω) with aμ∗(v,w)=(f,w)L2 for all w∈H01(Ω); uniqueness makes Kμ∗ independent of any choice, and linearity of f↦Kμ∗f follows from uniqueness exactly as for Kμ, since aμ∗ and the datum functional are linear in that slot.

2.1F1F3step 1.1givenalgebra

Adjoint identity. For f,g∈L2(Ω) put v:=Kμ∗g, so that aμ∗(v,w)=(g,w)L2 for every w∈H01(Ω). Testing at w=Kμf and conjugating, and using aμ∗(v,u)=aμ(u,v)‾, (Kμf,g)L2=(g,Kμf)L2‾=aμ∗(v,Kμf)‾=aμ(Kμf,v)=(f,v)L2=(f,Kμ∗g)L2, where the penultimate identity is the defining equation of Kμ. Hence Kμ∗ is the Hilbert-space adjoint of Kμ by [F3].

2.2F4step 1.1given

Compactness on bounded Ω. If Ω is bounded, [F1] and [F2] make Kμ∗:L2(Ω)→H01(Ω) bounded linear, and composing with the compact Rellich inclusion H01(Ω)↪L2(Ω) expresses Kμ∗ on L2(Ω) as a bounded map followed by a compact one, hence compact by [F4]; the Axiom of Choice is inherited through the Rellich supplier.

3.1F1F2step 1.1givenalgebra∎

Kernel at μ. For v∈L2(Ω) one has v∈ker⁡(I−μKμ∗) if and only if v=μKμ∗v, and since ran⁡Kμ∗⊆H01(Ω) this forces v∈H01(Ω) and, by the defining equation of Kμ∗ with datum μv, aμ∗(v,w)=μ(v,w)L2for every w∈H01(Ω), which is exactly a∗(v,w)=0 for every w. Conversely, if v∈H01(Ω) satisfies a∗(v,w)=0 for all w, then aμ∗(v,w)=μ(v,w)L2 for all w, so uniqueness in [F2] gives Kμ∗(μv)=v, that is μKμ∗v=v.

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