Alphabeta Math
Pipeline-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.

Operator domains, deficiency spaces and boundary realizations

1 · Prerequisites

2 · Summary

3 · Logical flowchart

4 · Definitions, postulates, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicableverified 2026-10-22 (gpt-6.1-sol)Open item page →

Closed symmetric operators and deficiency data

Definition

Assume the Axiom of Choice and Countable Choice. Let H be a complex Hilbert space and let S:D(S)→H be a densely defined, closed, symmetric linear operator. The domain D(S) is part of the operator data. Its adjoint is the operator S∗:D(S∗)→H characterized by ⟨Sf,g⟩=⟨f,S∗g⟩ for every f∈D(S) and g∈D(S∗), using an inner product linear in its first argument. A graph core for S is a linear subspace C⊆D(S) dense for the graph norm ∥f∥S=(∥f∥2+∥Sf∥2)1/2; equivalently, the graph of the restriction S∣C is dense in the graph of S.

Fix a positive scalar E∗ and write IH for the identity on H. The scaled deficiency subspaces of S at E∗ are N+(S;E∗):=ker⁡(S∗−iE∗IH) and N−(S;E∗):=ker⁡(S∗+iE∗IH). Their deficiency indices are n±(S;E∗):=dim⁡N±(S;E∗), where Hilbert dimension means the cardinality of an orthonormal basis as in the standard deficiency-index definition. The spaces are closed: if gk∈N±(S;E∗) and gk→g, then S∗gk=±iE∗gk→±iE∗g, so closedness of S∗ gives g∈D(S∗) and S∗g=±iE∗g. The dimension convention is well defined under Choice by the cited deficiency-index definition.

For any specified linear trace map γ:D(S∗)→B into a vector space B and specified linear subspace Λ⊆B, the restriction of S∗ to {f∈D(S∗):γ(f)∈Λ} is the boundary realization specified by (γ,Λ). Its domain and trace data are part of the operator realization; the differential expression alone is not.

LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passverified 2026-10-22 (gpt-6.1-sol)Open item page →

Minimal and maximal domains of the interval Laplacian

Statement

Assume the Axiom of Choice, Countable Choice, and Dependent Choice. Let 0<L<∞, let H=L2(0,L;C), and use the spaces H1(0,L) and H2(0,L) and their continuous endpoint traces defined by the one-dimensional Sobolev suppliers. Define Tcf=−D2f on D(Tc)=Cc∞(0,L). Then Tc is densely defined and symmetric, its adjoint is Tmax⁡f=−D2f on exactly D(Tmax⁡)=H2(0,L), and its closure Tmin⁡=Tc‾=Tc∗∗ has domain D(Tmin⁡)={f∈H2(0,L):f(0)=f′(0)=f(L)=f′(L)=0}, with Tmin⁡f=−D2f. The trace map γ:H2(0,L)→C4 defined by γ(f)=(f(0),f(L),f′(0),f′(L)) is surjective.

Facts & Assumptions

Given: The interval, Hilbert space, test-function operator, and trace map of the Statement. Derivatives are weak derivatives until a continuous representative is identified.

[A1]

Countable Choice, the Axiom of Choice, and Dependent Choice are the explicit hypotheses of the interval integration-by-parts supplier. The Axiom of Countable Choice (ACω) The Axiom of Choice The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain

[F1]

H1(0,L) consists of L2 classes with an L2 weak derivative, and H2(0,L) consists of those classes whose first and second weak derivatives lie in L2. Their norms and weak-derivative convention are fixed by One-dimensional Sobolev spaces on intervals and Weak derivative of a locally integrable function.

[F2]

H1 classes have continuous absolutely continuous representatives and endpoint traces; for f,g∈H2(0,L), ⟨−D2f,g⟩−⟨f,−D2g⟩=⟨Γ1f,Γ0g⟩−⟨Γ0f,Γ1g⟩, where Γ0f=(f(0),f(L)) and Γ1f=(f′(0),−f′(L)) (Endpoint trace bound and decay of H1 functions, Integration by parts and the endpoint-vanishing space on intervals).

[F3]

Cc∞(0,L) is dense in L2(0,L) (Smooth compactly supported functions of an open set are dense in L2).

[F4]

For a densely defined operator, g∈D(T∗) precisely when f↦⟨Tf,g⟩ is represented by a vector in the second argument of ⟨f,⋅⟩ (Adjoint of a densely defined operator).

[F5]

A densely defined symmetric operator is closable, its closure is its double adjoint, and T∗=(T‾)∗ (Symmetric, self-adjoint and essentially self-adjoint operators, Closability is equivalent to density of the adjoint domain).

[F6]

On the finite interval (0,L), Holder gives ∫0L∣h∣≤L ∥h∥L2(0,L) for h∈L2(0,L) (Holder's inequality for integrals, including the endpoint cases).

[F7]

The Lebesgue fundamental theorem for absolutely continuous functions states that if G:[a,b]→R is absolutely continuous, then G′ is Lebesgue integrable and G(b)−G(a)=∫abG′; apply it to the real and imaginary parts of a smooth complex test function on each compact interval (Fundamental theorem of calculus for absolutely continuous functions).

[F8]

Write λ for Lebesgue measure on (0,L); it is finite and hence sigma-finite. Tonelli's theorem for two sigma-finite measure spaces gives, for a nonnegative product-measurable q, equality of its product integral and either iterated integral (Tonelli's theorem for nonnegative measurable functions on a sigma-finite product).

[F9]

For two sigma-finite measure spaces, a product-measurable complex function with integrable absolute value on the product has integrable sections almost everywhere, and its product integral equals either iterated integral (Fubini's theorem for L^1 functions on a sigma-finite product).

Proof

Given: The hypotheses and objects in the Statement.

1.1A1F2F3

Density follows from [F3]. For f,g∈Cc∞(0,L), integration by parts gives ⟨−f′′,g⟩=⟨f,−g′′⟩, since both functions and their derivatives vanish near the endpoints. Thus Tc is dense and symmetric.

1.2A1F1F3F6F7F8F9

Suppose u∈L2(0,L) has distributional second derivative D2u=h∈L2(0,L). By [F6], h∈L1(0,L). Define v(x)=∫0xh(t) dt. Then ∣v(x)∣≤∥h∥L1≤L∥h∥2, so v∈L2(0,L). For every φ∈Cc∞(0,L), choose a measurable representative of h and define G(t,x):=1{0<t<x<L}h(t)φ′(x),(t,x)∈(0,L)2. The function q(t,x)=∣h(t)∣∣φ′(x)∣ is nonnegative and product-measurable. By [F6], h∈L1(0,L). The test derivative φ′ is continuous with compact support in (0,L), hence belongs to L2(0,L); [F6] then gives φ′∈L1(0,L). Tonelli [F8], applied only to this nonnegative product, gives ∫(0,L)2q d(λ×λ)=(∫0L∣h(t)∣ dt)(∫0L∣φ′(x)∣ dx)<∞. Since ∣G∣≤q, this establishes G∈L1((0,L)2) without using Fubini to prove its own hypothesis. Its sections are integrable for every parameter because h,φ′∈L1(0,L). Fubini [F9] therefore gives ∫0Lv(x)φ′(x) dx=∫0L∫0xh(t)φ′(x) dt dx=∫0Lh(t)(∫tLφ′(x) dx)dt=−∫0Lh(t)φ(t) dt, where [F7] applied to real and imaginary parts gives ∫tLφ′(x) dx=φ(L)−φ(t)=−φ(t), since φ vanishes near L. Hence Dv=h weakly and v∈H1. The distribution Du−v has derivative zero. For every test function φ of integral zero, its primitive ψ(x)=∫0xφ(t) dt is compactly supported in (0,L), and hence (Du−v)(φ)=(Du−v)(Dψ)=−(D(Du−v))(ψ)=0. Obtain a test function η with integral one as follows. The constant function 1 lies in L2(0,L) with norm L. By the density in [F3], choose χ∈Cc∞(0,L) with ∥χ−1∥2<L/2; then ∥χ∥2>L/2. Set η=∣χ∣2/∥χ∥22. It is a smooth compactly supported test function and ∫0Lη=1. For arbitrary φ, φ−(∫0Lφ)η has integral zero, so (Du−v)(φ)=(Du−v)(η)∫0Lφ. Therefore Du−v is a constant distribution, Du=v+c∈L2, and u∈H2(0,L) by [F1].

1.3F1constructalgebra

The Hermite cubic polynomials h00(s)=2s3−3s2+1, h01(s)=−2s3+3s2, h10(s)=s3−2s2+s, and h11(s)=s3−s2 satisfy the endpoint data (h00(0),h00(1),h00′(0),h00′(1))=(1,0,0,0), (h01(0),h01(1),h01′(0),h01′(1))=(0,1,0,0), (h10(0),h10(1),h10′(0),h10′(1))=(0,0,1,0), and (h11(0),h11(1),h11′(0),h11′(1))=(0,0,0,1). Consequently, for arbitrary a0,aL,d0,dL∈C, the polynomial p(x)=a0h00(x/L)+aLh01(x/L)+Ld0h10(x/L)+LdLh11(x/L) has p(0)=a0, p(L)=aL, p′(0)=d0, and p′(L)=dL. It belongs to H2(0,L), proving that γ is onto.

2.1A1F1F2F4step 1.2algebra

If g∈H2(0,L), [F2] applied with a compactly supported test function shows ⟨Tcf,g⟩=⟨f,−D2g⟩; thus g∈D(Tc∗) and Tc∗g=−D2g. Conversely, if g∈D(Tc∗) and h=Tc∗g, testing the adjoint identity against every f∈Cc∞(0,L) gives distributionally D2g=−h∈L2. Step 1.2 then gives g∈H2(0,L). Hence Tc∗=Tmax⁡ with exactly the claimed domain.

3.1A1F2F5step 1.2step 2.1step 1.3

By [F5] and step 2.1, Tmin⁡=Tc∗∗=Tmax⁡∗. If u∈D(Tmax⁡∗) and h=Tmax⁡∗u, testing against Cc∞(0,L)⊂H2(0,L) gives distributionally D2u=−h. Step 1.2 implies u∈H2(0,L). The adjoint identity for all g∈H2(0,L) and [F2] now reads ⟨Γ1g,Γ0u⟩−⟨Γ0g,Γ1u⟩=0. By step 1.3 the two traces of g can be prescribed independently: first set Γ0g=0 and vary Γ1g to obtain Γ0u=0; then set Γ1g=0 and vary Γ0g to obtain Γ1u=0. Conversely, if u∈H2 has both traces zero, [F2] gives ⟨Tmax⁡g,u⟩=⟨g,−D2u⟩ for every g∈H2, so u∈D(Tmax⁡∗). Therefore D(Tmin⁡)={u∈H2:Γ0u=Γ1u=0} and its action is −D2u.

4.1step 1.1step 2.1step 1.3step 3.1∎

The preceding steps establish density, symmetry, the exact adjoint, the closure domain, and trace surjectivity as stated.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passverified 2026-10-22 (gpt-6.1-sol)Open item page →

Unitary deficiency parameterization at a reference scale

Statement

Assume the Axiom of Choice and Countable Choice. Let H be a complex Hilbert space and S:D(S)→H a densely defined, closed, symmetric linear operator. Fix E∗>0 and let N±=N±(S;E∗) and n±=dim⁡N± be the scaled deficiency spaces and indices. For every unitary map V:N+→N−, the operator D(SV)=D(S)⊕{u+Vu:u∈N+},SV(f+u+Vu)=Sf+iE∗u−iE∗Vu is a self-adjoint extension of S. Every self-adjoint extension of S is uniquely SV for one such V. Consequently S has a self-adjoint extension if and only if n+=n−.

Facts & Assumptions

Given: The Hilbert space, closed symmetric operator, reference scale, deficiency spaces, and indices in the Statement. All inner products are linear in the first argument.

[A1]

The Axiom of Choice is the choice-function principle, and Countable Choice is its countable-family restriction (The Axiom of Choice, The Axiom of Countable Choice (ACω)).

[F1]

At scale E∗, N±=ker⁡(S∗∓iE∗I) and n±=dim⁡N±; these are closed Hilbert subspaces, and Hilbert dimension is the cardinality of an orthonormal basis Closed symmetric operators and deficiency data Deficiency subspaces and deficiency indices.

[F2]

For a densely defined operator A, ran⁡(A−z)⊥=ker⁡(A∗−z‾I); its adjoint is closed and reverses densely defined operator inclusion The adjoint is well defined, closed, and reverses inclusions.

[F3]

Every closed linear subspace of a Hilbert space has an orthogonal complement and gives the unique decomposition into that subspace and its orthogonal complement Orthogonal decomposition by a closed subspace.

[F4]

The graph norm of a closed operator is complete; on D(A) it is ∥f∥A2=∥f∥2+∥Af∥2 Unbounded linear operators: domain, graph and extension.

[F5]

For a self-adjoint operator, its Cayley transform CR=(R−iI)(R+iI)−1 is unitary; the Cayley map is one-to-one and its inverse sends a unitary W with ker⁡(I−W)={0} to a self-adjoint operator on ran⁡(I−W) (Cayley transform of a self-adjoint operator, Cayley correspondence between self-adjoint operators and unitaries).

[F6]

Equal Hilbert dimensions mean that orthonormal bases of the two spaces have bijective index sets; under Choice each such Hilbert space has an orthonormal basis and the dimension is independent of that basis Deficiency subspaces and deficiency indices, Injection, surjection, bijection.

[F7]

The adjoint is characterized by ⟨Af,g⟩=⟨f,A∗g⟩ for every f∈D(A) and g∈D(A∗) Adjoint of a densely defined operator.

Proof

Given: The objects in the Statement. Put A=E∗−1S on D(A)=D(S).

1.1F1F7algebra

The graph of A is the image of the graph of S under the bounded invertible map (f,g)↦(f,E∗−1g) on H⊕H, so it is closed; real scaling preserves symmetry. If g∈D(S∗), then for every f∈D(S), ⟨Af,g⟩=E∗−1⟨Sf,g⟩=⟨f,E∗−1S∗g⟩, so g∈D(A∗) and A∗g=E∗−1S∗g. Conversely, if g∈D(A∗), then ⟨Sf,g⟩=E∗⟨Af,g⟩=⟨f,E∗A∗g⟩, so g∈D(S∗) and S∗g=E∗A∗g. Therefore D(A∗)=D(S∗) and A∗=E∗−1S∗. Since A∗∓iI=E∗−1(S∗∓iE∗I), the ordinary deficiency spaces of A at ±i are exactly N±.

1.2A1F6construct

Suppose n+=n−. Choose orthonormal bases (ej)j∈J+ of N+ and (fj)j∈J− of N−. By [F6], choose a bijection π:J+→J−. The map V0ej=fπ(j) preserves norms on finite linear combinations by orthonormality, so it extends continuously to an isometry V:N+→N−. Its range contains the finite span of the fj, which is dense; the range of an isometry from the complete space N+ is closed, so V is onto and unitary.

2.1step 1.1F2F3

For f∈D(A), symmetry makes ⟨Af,f⟩ real; expanding the two norms gives ∥(A±iI)f∥2=∥Af∥2+∥f∥2. Thus A±iI are injective. If (A±iI)fk converges, the norm identity applied to differences makes (fk) Cauchy and then (Afk) Cauchy; closedness of A shows the limit is in the range. Hence M±:=ran⁡(A±iI) are closed. By [F2] and [F3], H=M+⊕N+=M−⊕N−, with orthogonal sums.

2.2step 1.1F2F3F4F7

Equip D(A∗) with the graph inner product ⟨f,g⟩A∗=⟨f,g⟩+⟨A∗f,A∗g⟩. It is complete by [F2, F4], and D(A) is a closed subspace because A is closed and A∗f=Af there. If z∈D(A∗) is graph-orthogonal to D(A), then for every f∈D(A), ⟨Af,A∗z⟩=−⟨f,z⟩. By the adjoint definition, this means A∗z∈D(A∗) and A∗2z=−z. Therefore z+=(z−iA∗z)/2 and z−=(z+iA∗z)/2 satisfy A∗z+=iz+ and A∗z−=−iz−, and z=z++z−. Conversely, D(A) is graph-orthogonal to both kernels: for u∈N+, ⟨f,u⟩+⟨Af,A∗u⟩=⟨f,u⟩+⟨Af,iu⟩=0 by the adjoint identity and conjugate-linearity in the second argument, and the same computation with A∗u=−iu holds for u∈N−. If u∈N+ and v∈N−, then ⟨u,v⟩+⟨A∗u,A∗v⟩=⟨u,v⟩+⟨iu,−iv⟩=0. Thus the two kernels are graph-orthogonal to each other. Applying [F3] in the graph Hilbert space proves the orthogonal decomposition D(A∗)=D(A)⊕N+⊕N−.

3.1F2F3F5step 2.1

Define CA:M+→M− by CA((A+iI)f)=(A−iI)f. Injectivity of A+iI makes this well defined, the norm identity in step 2.1 makes it an isometry, and it is onto M−. Define W(m+u)=CAm−Vu for m∈M+ and u∈N+. The decompositions from step 2.1 make W well defined; it is unitary because its two orthogonal summands are mapped isometrically onto M− and N−. For f∈D(A), (I−W)(A+iI)f=2if, so ran⁡(I−W) is dense. If Wz=z, then z is orthogonal to ran⁡(I−W) by unitarity, hence to the dense domain D(A), so z=0. The Cayley correspondence [F5] therefore gives a self-adjoint operator AV with Cayley transform W.

4.1F5step 1.1step 2.1step 3.1algebra

For m=(A+iI)f and u∈N+, direct calculation gives (I−W)(m+u)=2if+u+Vu and i(I+W)(m+u)=2iAf+iu−iVu. The Cayley inverse is AV=i(I+W)(I−W)−1 on ran⁡(I−W), so D(AV)=ran⁡(I−W)=D(A)+{u+Vu:u∈N+} and AV(2if+u+Vu)=2iAf+iu−iVu. Equivalently, after renaming 2if as f, AV(f+u+Vu)=Af+iu−iVu. The sum is direct: if f=u+Vu∈D(A), then (I−W)(A+iI)f=2if=(I−W)(2iu); injectivity of I−W gives (A+iI)f=2iu. Its left side lies in M+ and its right side in N+, whose intersection is zero, so u=f=0. Multiplication by E∗ gives the displayed domain and action for SV=E∗AV. The two-way scalar-adjoint calculation in step 1.1 applies to AV as well, so SV∗=E∗AV∗=SV. Thus SV is a self-adjoint extension of S.

4.2F2F5step 1.1step 2.1step 3.1

Conversely, let T be any self-adjoint extension of S and put R=E∗−1T. The two-way scalar-adjoint calculation in step 1.1 gives R∗=E∗−1T∗=R, so R is a self-adjoint extension of A. Its Cayley transform CR is unitary by [F5] and agrees with CA on M+, since R equals A on D(A). A unitary carrying M+ onto M− carries their orthogonal complements N+ onto N− by step 2.1 and [F2]; hence CR(N+)=N−. Put V=−CR∣N+; this is unitary. The unitary W constructed from this V agrees with CR on both orthogonal summands of H, so uniqueness in [F5] gives R=AV. This determines V uniquely from T and proves that every self-adjoint extension of S is uniquely SV.

5.1A1F6step 1.2step 4.1step 4.2∎

If n+=n−, step 1.2 supplies a unitary and step 4.1 supplies a self-adjoint extension. If an extension exists, step 4.2 supplies a unitary N+→N−, so its orthonormal bases have bijective index sets and n+=n−. This proves the existence equivalence and the complete parameterization.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passverified 2026-10-22 (gpt-6.1-sol)Open item page →

All self-adjoint interval Laplacian boundary conditions

Statement

Assume the Axiom of Choice, Countable Choice, and Dependent Choice. Let 0<L<∞, let H=L2(0,L;C), and let Tmin⁡ and Tmax⁡=Tmin⁡∗ be the minimal and maximal realizations of −D2 from the preceding interval-domain lemma. Fix a positive reference length ℓ. For f∈H2(0,L) define Γ0f=(f(0),f(L)) and Γ1f=(f′(0),−f′(L)). Let U(2)={U∈M2(C):U∗U=UU∗=I2}, where U∗ is conjugate transpose. For each U∈U(2) define D(TU)={f∈H2(0,L):(U−I2)Γ0f+iℓ(U+I2)Γ1f=0},TUf=−D2f. Then Tmin⁡⊆TU⊆Tmax⁡, each TU is self-adjoint, and every self-adjoint realization between Tmin⁡ and Tmax⁡ equals exactly one TU. The reference length makes the value and scaled derivative boundary vectors have the same units if the interval coordinate is assigned units; in the dimensionless mathematical model they are numerical vectors.

Facts & Assumptions

Given: L>0, the interval Hilbert space, the positive scale ℓ, and the operators in the Statement. Inner products are linear in the first argument.

[A1]

The Axiom of Choice, Countable Choice, and Dependent Choice are the hypotheses of the interval Sobolev trace and integration-by-parts suppliers. The Axiom of Choice The Axiom of Countable Choice (ACω) The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain

[F1]

Tmin⁡ has domain consisting of the H2 functions with both value and derivative traces zero at both endpoints; Tmax⁡ is −D2 on H2(0,L), and the four-coordinate trace map is onto Minimal and maximal domains of the interval Laplacian.

[F2]

For f,g∈H2(0,L), ⟨−D2f,g⟩−⟨f,−D2g⟩=⟨Γ1f,Γ0g⟩−⟨Γ0f,Γ1g⟩ (Integration by parts and the endpoint-vanishing space on intervals).

[F3]

Adjoint inclusion reverses operator inclusion: if A⊆B, then B∗⊆A∗, including their domains (The adjoint is well defined, closed, and reverses inclusions).

[F4]

Every self-adjoint extension of a densely defined closed symmetric operator is uniquely parameterized by a unitary map between its two deficiency subspaces, using the graph-domain formula of Unitary deficiency parameterization at a reference scale.

Proof

Given: The hypotheses in the Statement and Facts & Assumptions.

1.1A1F1construct

Let T be any linear operator with Tmin⁡⊆T⊆Tmax⁡. For this proof write γbf=(Γ0f,Γ1f)∈C2×C2. This is the four-coordinate trace map of [F1] with the last coordinate sign reversed, so it is onto and has kernel D(Tmin⁡). Its image M:=γb(D(T)) is a linear subspace. Since ker⁡γb=D(Tmin⁡)⊆D(T), every f∈H2 whose trace lies in M differs from a member of D(T) by an element of D(Tmin⁡); thus D(T)=γb−1(M). Conversely, every linear subspace M gives such a domain because γb is onto.

1.2A1F1F2F3

Define B((a,b),(a′,b′))=⟨b,a′⟩−⟨a,b′⟩ and Mω={z:B(m,z)=0 for every m∈M}. By [F2], integration by parts gives T∗=Tγb−1(Mω): indeed, since Tmin⁡⊆T, adjoint inclusion reversal puts D(T∗) inside D(Tmin⁡∗)=H2, and for g∈H2 the adjoint identity for every f∈D(T) is exactly B(γbf,γbg)=0. Hence T is self-adjoint if and only if M=Mω.

2.1A1F1F2step 1.1step 1.2algebra

Put γℓf=(a,b):=(Γ0f,ℓΓ1f) and let M^=γℓ(D(T)). Equivalently, M^={(a,b):(a,b/ℓ)∈M}, where M is the unscaled trace image from step 1.1. Define B^((a,b),(a′,b′))=⟨b,a′⟩−⟨a,b′⟩ and M^ω^:={z:B^(m,z)=0 for all m∈M^}. Since B^=ℓB after undoing the derivative scaling and ℓ>0, step 1.2 gives M^=M^ω^ exactly when T is self-adjoint. The map γℓ is onto because the trace map in [F1] is onto and multiplying its derivative coordinates by ℓ>0 is invertible. For x=a+ib and y=a−ib, direct expansion using the first-variable-linear inner product gives B^((a,b),(a′,b′))=⟨x,x′⟩−⟨y,y′⟩2i. Thus M^=M^ω^ implies that (a,b)↦(x,y) sends M^ to the graph of an inner-product-preserving linear map R:X→C2, where X={a+ib:(a,b)∈M^}. It is well defined: if a member of M^ has x=0, isotropy gives ∥y∥2=∥x∥2=0, so y=0. Maximality forces X=C2. Indeed, define X⊥={z:⟨x,z⟩=0 for every x∈X} with ⟨x,z⟩=x1z1‾+x2z2‾. Every proper complex linear subspace X has a nonzero vector in X⊥, by the following coordinate argument. If X={0}, take x0=(1,0). Otherwise take 0≠v=(v1,v2)∈X. Every w∈X is a multiple of v: if v1w2−v2w1≠0, the inverse of the two-column matrix (v,w) expresses both standard coordinate vectors as linear combinations of v,w, implying X=C2; if this determinant is zero, solving in a nonzero coordinate of v gives w=cv. Thus for proper X one has X=span⁡{v}, and x0=(−v2‾,v1‾)≠0 satisfies ⟨cv,x0⟩=c(−v1v2+v2v1)=0. No closed-subspace decomposition or additional choice principle is used. If X were proper, take this x0 and set a=x0/2, b=x0/(2i), so (x,y)=(x0,0). The displayed identity makes this boundary pair orthogonal for B^ to all of M^, hence it lies in M^ω^=M^; then x0∈X∩X⊥, a contradiction. Therefore R is a linear isometry from C2 into C2. Let e1,e2 be the standard basis and write Re1=(α1,β1) and Re2=(α2,β2). Isometry gives ∣α1∣2+∣β1∣2=∣α2∣2+∣β2∣2=1,α1α2‾+β1β2‾=0. Direct expansion gives ∣α1β2−α2β1∣2=(∣α1∣2+∣β1∣2)(∣α2∣2+∣β2∣2)−∣α1α2‾+β1β2‾∣2=1. Thus the matrix U with columns Re1,Re2 is invertible, so these vectors span C2 and R is onto. Their orthonormality gives U∗U=I2; since U is invertible, this implies U∗=U−1 and hence UU∗=I2. Thus U∈U(2), and its graph condition is U(a+ib)=a−ib, equivalently (U−I2)a+i(U+I2)b=0. This U is unique because its value is fixed for every x∈C2.

3.1step 1.2step 2.1algebra

Conversely, let U∈U(2) and set M^U={(a,b):U(a+ib)=a−ib} in the scaled boundary coordinates. Every x∈C2 occurs, by taking a=(x+Ux)/2 and b=(x−Ux)/(2i). Unitarity gives ⟨x,x′⟩=⟨Ux,Ux′⟩ for every pair, so the displayed formula in step 2.1 makes M^U isotropic. If (a,b)∈M^Uω^, then for every x′∈C2 that formula gives ⟨x′,x⟩=⟨Ux′,y⟩=⟨x′,U∗y⟩, hence x=U∗y and y=Ux; therefore (a,b)∈M^U. Thus M^U=M^Uω^. Since γℓ is onto, the restriction to γℓ−1(M^U) is self-adjoint by the criterion in step 1.2 and the scaling equivalence in step 2.1. Its boundary equation is exactly the Statement's equation, and its domain lies between Tmin⁡ and Tmax⁡ because it is a restriction of Tmax⁡ whose domain contains the zero-trace domain.

4.1A1F4F5step 2.1step 3.1∎

The preceding steps give a bijection from U(2) to the entire set of self-adjoint extensions between Tmin⁡ and Tmax⁡. By [F4], that same extension set is uniquely parameterized by the abstract unitaries between the deficiency subspaces. Composing the two bijections identifies the boundary-matrix labels with the abstract deficiency labels and proves that the displayed boundary family is exhaustive.

Remarks

For U=−I2 the condition is Γ0f=0, the Dirichlet realization; for U=I2 it is Γ1f=0, the Neumann realization. The parameterization allows coupled endpoint conditions as well. It is a classification of mathematical self-adjoint domains and does not select a physical boundary condition.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passverified 2026-10-22 (gpt-6.1-sol)Open item page →

A symmetric half-line momentum with no self-adjoint extension

Statement

Assume the Axiom of Choice, Countable Choice, and Dependent Choice. On H=L2(0,∞;C) let Scf=−iDf with domain D(Sc)=Cc∞(0,∞). Its closure S‾c has deficiency indices (n+,n−)=(1,0) at reference scale E∗=1, and therefore has no self-adjoint extension on H.

Facts & Assumptions

Given: The half-line Hilbert space and operator in the Statement.

[A1]

Countable Choice, the Axiom of Choice, and Dependent Choice are the hypotheses of the interval Sobolev and integration-by-parts suppliers. The Axiom of Countable Choice (ACω) The Axiom of Choice The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain

[F1]

H1(0,∞) consists of the L2 classes with weak derivative in L2. On each bounded subinterval the class has the unique absolutely continuous representative of One-dimensional Sobolev spaces on intervals and Absolutely continuous representative of an L2 function with L2 weak derivative. Uniqueness makes these representatives agree on overlaps, defining one locally absolutely continuous representative on (0,∞). The half-line integration-by-parts identity is clause (d) of Integration by parts and the endpoint-vanishing space on intervals.

[F2]

The adjoint is characterized by ⟨Scf,g⟩=⟨f,Sc∗g⟩ on the dense domain Cc∞(0,∞); a densely defined symmetric operator is closable and the adjoint of its closure equals its adjoint (Adjoint of a densely defined operator, Symmetric, self-adjoint and essentially self-adjoint operators, Closability is equivalent to density of the adjoint domain). The weak derivative convention is the test-function identity of Weak derivative of a locally integrable function.

[F3]

Absolute continuity on a compact real interval means that small total length of a finite family of pairwise interior-disjoint subintervals forces small total endpoint increment; complex-valued absolute continuity is componentwise (Absolute continuity on a compact interval, One-dimensional W1,p functions have unique absolutely continuous representatives). For real x, the complex exponential equals the real exponential, and the complex entire theorem gives its derivative as itself (The complex exponential is entire and its complex derivative is itself, exp⁡(z+w)=exp⁡z exp⁡w, and the complex exponential extends the real exponential). The real derivative theorem and real chain rule give (ex)′=ex and (e−x)′=−e−x (The exponential function is smooth and (exp⁡)′=exp⁡, The chain rule, in one line from Carathéodory: if g is differentiable at c and f is differentiable at g(c), then f∘g is differentiable at c with (f∘g)′(c)=f′(g(c)) g′(c)). The H1 representative's classical derivative equals its weak derivative a.e., and its increments are the integrals of that derivative, by the representative result cited above. On each compact interval, the real exponential is C1 with bounded derivative, hence Lipschitz and absolutely continuous by C1 implies Lipschitz, Lipschitz implies absolutely continuous, and absolutely continuous implies continuous and bounded variation. The exponential times the representative is then absolutely continuous by The product of two absolutely continuous functions is absolutely continuous applied to real and imaginary parts. At every point where the representative is differentiable, the real product rule from Sums, scalar multiples, products and quotients: (f+g)′(c)=f′(c)+g′(c), (αf)′(c)=αf′(c), (fg)′(c)=f′(c)g(c)+f(c)g′(c), and (f/g)′(c)=(f′(c)g(c)−f(c)g′(c))/g(c)2 when g(c)≠0 gives the derivative of that product; hence the formula holds almost everywhere. For a real absolutely continuous function, zero derivative almost everywhere implies constancy by the fundamental theorem of calculus (Fundamental theorem of calculus for absolutely continuous functions); apply this to the real and imaginary parts for complex-valued products.

[F4]

For a closed densely defined symmetric operator, a self-adjoint extension exists exactly when its two deficiency indices agree (Closed symmetric operators and deficiency data, Unitary deficiency parameterization at a reference scale).

[F5]

Cc∞(0,∞) is dense in L2(0,∞) by the smooth-test density theorem on open subsets of R (Smooth compactly supported functions of an open set are dense in L2).

Proof

Given: The hypotheses of the Statement.

1.1A1F1F2F5

By [F5], the test functions are dense in L2(0,∞). For f,g∈Cc∞(0,∞), integration by parts [F1] gives ⟨Scf,g⟩=⟨f,Scg⟩ with no endpoint terms. Thus Sc is symmetric, so it is closable by [F2], and S‾c ∗=Sc∗.

2.1A1F1F2step 1.1

If g∈H1(0,∞), [F1] gives ⟨Scf,g⟩=⟨f,−iDg⟩ for every test f, so g∈D(Sc∗) and Sc∗g=−iDg. Conversely, if g∈D(Sc∗) and h=Sc∗g, testing the adjoint identity against every f∈Cc∞(0,∞) says distributionally Dg=ih∈L2. Together with g∈L2 this is exactly g∈H1. Hence D(Sc∗)=H1(0,∞) and Sc∗=−iD.

3.1A1F1F3step 2.1algebra

By step 2.1, g∈N+(S‾c;1) exactly when g∈H1 and −iDg=ig, that is, Dg=−g. Its absolutely continuous representative satisfies (exg(x))′=ex(g(x)+g′(x))=0 almost everywhere by the product rule in [F3] and g′=−g. On each bounded subinterval the absolutely continuous fundamental theorem in [F3] makes exg(x) constant; overlap consistency makes it one constant c on the whole half-line. Thus g(x)=ce−x. Since ∫0∞e−2x dx=1/2, this is in L2 for every c, and its classical derivative −ce−x is also in L2 and is its weak derivative by [F1]. Thus every such function is in H1 and satisfies the kernel equation, so N+={ce−x:c∈C} is one-dimensional.

4.1A1F1F3step 1.1step 2.1step 3.1algebra

A vector g∈N−(S‾c;1) satisfies Dg=g by step 2.1, so (e−xg(x))′=e−x(g′(x)−g(x))=0 almost everywhere by [F3] and g′=g. On each bounded subinterval the absolutely continuous fundamental theorem in [F3] makes e−xg(x) constant; overlap consistency gives one c∈C on the whole half-line, so g(x)=cex. If c≠0, ∫0R∣cex∣2dx=∣c∣2(e2R−1)/2→∞, contradicting g∈L2(0,∞). Hence c=0, N−={0} and n−=0. Combining step 3.1's positive-deficiency calculation with this result and the common adjoint from step 1.1 gives the closure's indices (1,0).

5.1A1F4step 3.1step 4.1∎

The indices are unequal, so [F4] implies that S‾c has no self-adjoint extension on H. This proves the Statement.

Remarks

Teschl's Problem 2.27 uses A0=+iD on the same test-function domain, whereas Sc=−A0. For the convention here, N+(A;1)=ker⁡(A∗−iI) and N−(A;1)=ker⁡(A∗+iI). The adjoint definition gives Sc∗=−A0∗, so N+(Sc;1)=N−(A0;1) and N−(Sc;1)=N+(A0;1). Thus negating the operator swaps the two deficiency indices. The local kernel calculations in steps 3.1 and 4.1 establish (1,0) for −iD directly; the exercise is a locator for the related +iD problem, not a substitute for this sign check.

5 · Examples, experiments and counterexamples

None yet.

Sources