Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
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 Fredholm alternative for weak elliptic Dirichlet problems

Statement

Assume the Axiom of Choice and Countable Choice. Let Ω⊆Rn be bounded open, K∈{R,C}, and let L,a be as in Uniformly elliptic divergence-form operators and their sesquilinear forms with ellipticity constant θ and coefficient bounds Ma,Mb,Mc. Let a∗ be the adjoint form of The formal adjoint and the adjoint weak Dirichlet problem. Consider the weak Dirichlet problem a(u,v)=(f,v)L2 for all v∈H01(Ω), with datum f∈L2(Ω) (Weak Dirichlet solutions for a divergence-form operator). Then exactly one of the following alternatives holds. (1) The homogeneous problem a(u,v)=0 for all v∈H01(Ω) has only the solution u=0. Then for every f∈L2(Ω) the problem has exactly one weak solution u∈H01(Ω). (2) The homogeneous problem has a nonzero solution. Then both homogeneous solution spaces N:={u∈H01(Ω):a(u,v)=0 ∀v},N∗:={v∈H01(Ω):a∗(v,w)=0 ∀w} are finite-dimensional and nontrivial with dim⁡N=dim⁡N∗; for f∈L2(Ω) the problem has a solution if and only if (f,v)L2=0 for every v∈N∗; and whenever a solution exists the solution set is an affine translate of N, so uniqueness fails. The data class is L2(Ω); the weaker class H−1(Ω) is deliberately not treated here.

Facts & Assumptions

Given: the Axiom of Choice and Countable Choice; a bounded open set Ω⊆Rn; the divergence-form operator L and form a with constants θ,Ma,Mb,Mc; the adjoint form a∗; a fixed μ≥β; the shifted solution operator Kμ and its adjoint Kμ∗; and f∈L2(Ω).

[F1]

Operator reduction: for u∈H01(Ω) the weak equation a(u,v)=(f,v)L2 for all v∈H01(Ω) is equivalent to (I−μKμ)u=Kμf in L2(Ω), and both sides of that equation lie in H01(Ω) (On bounded domains, the unshifted equation is an identity-minus-compact equation).

[F2]

Compactness and the abstract alternative: A:=I−μKμ is an identity-minus-compact operator on the Banach space L2(Ω), the homogeneous spaces satisfy N=ker⁡A and, under the Riesz identification, N∗=ker⁡A∗, and Kμf∈ran⁡A if and only if (f,v)L2=0 for every v∈N∗ (The adjoint solution operator solves the adjoint form problem, The elliptic Fredholm range condition is orthogonality to the adjoint kernel, Fredholm alternative for identity minus compact, Kernel of identity minus compact is finite dimensional, Compact linear operator, The Axiom of Choice).

[F3]

Abstract Fredholm alternatives: for a compact K on a Banach space and A=I−K, either A is injective, in which case it is bijective with bounded inverse, or ker⁡A and the cokernel are finite dimensional and nontrivial with equal dimensions (Fredholm alternative for identity minus compact). The range of A=I−μKμ is closed by Range of identity minus compact is closed; AC supplies its DC premise by AC supplies the countable and dependent choices used in Banach integration. By Orthogonal decomposition by a closed subspace, L2=ran⁡A⊕(ran⁡A)⊥. The adjoint identity gives (ran⁡A)⊥=ker⁡(I−μKμ∗), and v↦v+ran⁡A restricts to a linear bijection from this orthogonal kernel onto the cokernel.

Proof

technique · direct
1.1F1F2F4given

Identification of the spaces. By [F1] with f=0, a class u∈H01(Ω) solves the homogeneous problem a(u,v)=0 for all v if and only if (I−μKμ)u=0; since ran⁡Kμ⊆H01(Ω), this identifies N with ker⁡A, where A=I−μKμ is bounded on L2(Ω). By [F2] the adjoint homogeneous space N∗ is, under the Riesz identification of L2(Ω) with its dual, exactly the kernel of the transpose A∗, and for f∈L2(Ω) the solvability of the weak problem is equivalent to Kμf∈ran⁡A, hence to (f,v)L2=0 for every v∈N∗.

2.1F2F3step 1.1given

The two alternatives. Since μKμ is compact, [F3] gives exactly the following dichotomy for A=I−μKμ: either A is injective, hence bijective with bounded inverse, or ker⁡A≠{0} and both ker⁡A and the cokernel are finite dimensional with equal dimensions. In the first case ker⁡A=N={0} by step 1.1.

3.1F1step 2.1given

Case (1). Assume N={0}. Then A is injective, so by step 2.1 it is bijective and boundedly invertible; for every f∈L2(Ω) the equation Au=Kμf has the unique solution u=A−1Kμf∈L2(Ω); the equation gives u=Kμf+μKμu∈H01(Ω), and then [F1] shows that it solves the weak problem, and by the equivalence [F1] any weak solution gives a solution of Au=Kμf, so the weak solution is unique. This proves alternative (1).

3.2F1F2step 1.1step 2.1givenalgebra

Case (2). Assume N≠{0}. Then ker⁡A=N is nontrivial and finite dimensional, and by step 2.1 its dimension equals that of the cokernel, which under the Riesz identification is dim⁡ker⁡A∗=dim⁡N∗; so N and N∗ are finite-dimensional and nontrivial with dim⁡N=dim⁡N∗. By step 1.1 the weak problem is solvable exactly when (f,v)L2=0 for every v∈N∗. If u0 is one solution, then for any u the class u−u0 satisfies the homogeneous problem, i.e. lies in N, and conversely u0+n with n∈N is a solution; hence the solution set is the affine translate u0+N, which is not a singleton because N≠{0}, so uniqueness fails. This proves alternative (2).

4.1F2F3step 3.1step 3.2given∎

Exhaustiveness. Steps 3.1 and 3.2 cover the two mutually exclusive possibilities of step 2.1, so exactly one of the alternatives holds; the datum class is L2(Ω) throughout, no H−1(Ω) data are used, and the Axiom of Choice is inherited only through the compactness of Kμ and the abstract Fredholm alternative.

Depends on

Used by

Dependency tree · two levels

98 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