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 , let , and let and be the minimal and maximal realizations of from the preceding interval-domain lemma. Fix a positive reference length . For define and . Let , where is conjugate transpose. For each define Then , each is self-adjoint, and every self-adjoint realization between and equals exactly one . 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.
Statement references
Facts & Assumptions
Given: , the interval Hilbert space, the positive scale , and the operators in the Statement. Inner products are linear in the first argument.
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 () The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain
has domain consisting of the functions with both value and derivative traces zero at both endpoints; is on , and the four-coordinate trace map is onto Minimal and maximal domains of the interval Laplacian.
Adjoint inclusion reverses operator inclusion: if , then , including their domains (The adjoint is well defined, closed, and reverses inclusions).
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.
A function is single-valued on its declared domain, and a bijection is an injective and surjective function (A function is a relation with and implying ; , the value , domain and codomain, Injection, surjection, bijection).
Proof
Given: The hypotheses in the Statement and Facts & Assumptions.
Let be any linear operator with . For this proof write . This is the four-coordinate trace map of [F1] with the last coordinate sign reversed, so it is onto and has kernel . Its image is a linear subspace. Since , every whose trace lies in differs from a member of by an element of ; thus . Conversely, every linear subspace gives such a domain because is onto.
Define and . By [F2], integration by parts gives : indeed, since , adjoint inclusion reversal puts inside , and for the adjoint identity for every is exactly . Hence is self-adjoint if and only if .
Put and let . Equivalently, , where is the unscaled trace image from step 1.1. Define and . Since after undoing the derivative scaling and , step 1.2 gives exactly when is self-adjoint. The map is onto because the trace map in [F1] is onto and multiplying its derivative coordinates by is invertible. For and , direct expansion using the first-variable-linear inner product gives Thus implies that sends to the graph of an inner-product-preserving linear map , where . It is well defined: if a member of has , isotropy gives , so . Maximality forces . Indeed, define with . Every proper complex linear subspace has a nonzero vector in , by the following coordinate argument. If , take . Otherwise take . Every is a multiple of : if , the inverse of the two-column matrix expresses both standard coordinate vectors as linear combinations of , implying ; if this determinant is zero, solving in a nonzero coordinate of gives . Thus for proper one has , and satisfies . No closed-subspace decomposition or additional choice principle is used. If were proper, take this and set , , so . The displayed identity makes this boundary pair orthogonal for to all of , hence it lies in ; then , a contradiction. Therefore is a linear isometry from into . Let be the standard basis and write and . Isometry gives Direct expansion gives Thus the matrix with columns is invertible, so these vectors span and is onto. Their orthonormality gives ; since is invertible, this implies and hence . Thus , and its graph condition is , equivalently . This is unique because its value is fixed for every .
Conversely, let and set in the scaled boundary coordinates. Every occurs, by taking and . Unitarity gives for every pair, so the displayed formula in step 2.1 makes isotropic. If , then for every that formula gives , hence and ; therefore . Thus . Since is onto, the restriction to 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 and because it is a restriction of whose domain contains the zero-trace domain.
The preceding steps give a bijection from to the entire set of self-adjoint extensions between and . 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 the condition is , the Dirichlet realization; for it is , 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
Closed symmetric operators and deficiency data
Minimal and maximal domains of the interval Laplacian
Unitary deficiency parameterization at a reference scale
One-dimensional Sobolev spaces on intervals
Endpoint trace bound and decay of H1 functions
Integration by parts and the endpoint-vanishing space on intervals
The adjoint is well defined, closed, and reverses inclusions
A function is a relation with and implying ; , the value , domain and codomain
Injection, surjection, bijection
The Axiom of Choice
The Axiom of Countable Choice ()
The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain