Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedPipeline-generatedprecheck passverified 2026-10-22 (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.

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.

Depends on

Dependency tree · 2 levels

Sources