Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedverified 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.

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.

Depends on

Dependency tree · 2 levels

Sources