Alphabeta Math
RemarkRemark: Literature-sourcedProof: Not applicablePipeline-generatedaudited 2026-09-22 rests on later material (inherited)
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.

Self-adjoint extensions and deficiency indices: agreement pointer

Remark

Assume the Axiom of Choice (The Axiom of Choice). The extension theorem is proved on the companion A page of this pair: self-adjoint extensions of a closed symmetric operator T correspond bijectively to the unitary operators K+K (Von Neumann parameterization of self-adjoint extensions), and such a unitary exists exactly when the deficiency dimensions agree (Existence of self-adjoint extensions is equality of deficiency indices, Deficiency subspaces and deficiency indices). The parameterization determines the extension's domain and action, not merely the number of extensions, and when a unitary is supplied no further choice is used to produce the extension. Equality of deficiency dimensions by itself does not exhibit a unitary: the Hilbert-basis input producing one is recorded on the A page. The minimal derivative operator of The minimal derivative has deficiency indices (1,1) and many self-adjoint extensions is the one-dimensional instance: the unitaries K+K are there the scalars λ with λ=ex/ex=1/e, in bijection with the boundary parameters μ of modulus one in the conditions f(1)=μf(0).

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

30 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