Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)
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 unbounded polynomial interaction at fixed regulator

Statement

Assume Countable Choice and the data of Positive injective compact polynomial form resolvent. Its variational operator R is compact, self-adjoint, positive, and injective on the infinite-dimensional complex Hilbert space HN. Let (μn)n≥1 be its positive eigenvalues in nonincreasing order, with multiplicity, and choose corresponding orthonormal eigenvectors (ψn)n≥1. Put En:=μn−1−1 and define D(S):={u=∑n≥1cnψn∈HN:∑n≥1En2∣cn∣2<∞},Su:=∑n≥1Encnψn. The series for u converges in HN by the Hilbert-space expansion theorem. Then S is self-adjoint and satisfies ⟨Su,u⟩≥∥u∥22 for every u∈D(S); also (S+I)−1=R is compact. For every u∈Cc∞(RN;C), Su=−∑j=1Naj∂j2u+Wu. Consequently h:=S−(C0+1)I, on the same domain, is a self-adjoint realization of the differential expression in Finite-lattice polynomial Hamiltonian data and satisfies ⟨hu,u⟩≥−C0∥u∥22 for every u∈D(h). It has compact resolvent, meaning that for some z∈C the map h−zI:D(h)→HN is bijective with bounded inverse on HN, and that inverse is compact; here z=−(C0+2) and (h+(C0+2)I)−1=R. Put λn:=En−C0−1, the eigenvalues of h; equivalently, D(h)={u=∑ncnψn:∑nλn2∣cn∣2<∞}. For every u∈Q, a(u,u)=∑n≥1(En+1)∣⟨u,ψn⟩∣2,qh(u):=a(u,u)−(C0+2)∥u∥22=∑n≥1λn∣⟨u,ψn⟩∣2. The lowest eigenvalue is attained and has finite multiplicity. This selects a form realization; it does not assert that the differential expression on Cc∞ is essentially self-adjoint or that it has no other self-adjoint extensions.

Facts & Assumptions

Given: Countable Choice, HN, the compact positive injective operator R, and its variational form.

[A1]

The Axiom of Countable Choice (ACω): every countable family of nonempty sets has a choice function; this is used to select orthonormal bases in countably many finite-dimensional eigenspaces.

[F1]

Positive injective compact polynomial form resolvent: R is bounded, compact, self-adjoint, positive, injective, and ∥R∥≤12; for each f∈HN, Rf∈Q is the unique vector satisfying a(v,Rf)=⟨v,f⟩ for all v∈Q.

[F2]

Spectral theorem for compact self adjoint operators: the nonzero eigenspaces of a compact self-adjoint operator are finite-dimensional, their eigenvalues are real with only possible accumulation point 0, and their closed span is (ker⁡R)⊥.

[F3]

Every finite-dimensional real or complex inner product space has an orthonormal basis: each finite-dimensional eigenspace has an orthonormal basis.

[F4]

Fourier expansion in a Hilbert space: a complete orthonormal family in a Hilbert space gives norm-convergent finite-subset expansions and Parseval's identity.

[F5]

Unbounded linear operators: domain, graph and extension, Adjoint of a densely defined operator, and Symmetric, self-adjoint and essentially self-adjoint operators: an unbounded operator has a specified linear domain; its adjoint domain consists of vectors for which the defining pairing is represented by a Hilbert-space vector; a densely defined operator is self-adjoint exactly when its domain equals its adjoint domain and the actions agree.

[F6]

Coercive polynomial form completion and injection and Fourier expansion in a Hilbert space: (Q,a) is a Hilbert space, Q injects into HN, and a complete orthonormal family in either Hilbert space has Parseval expansion in its Hilbert norm.

Proof

technique · direct
1.1F1F2algebra

By [F1], R is compact and self-adjoint. Applying [F2] and using ker⁡R={0} shows that the closed span of its nonzero eigenspaces is all of HN. If Rψ=μψ with ψ≠0, then μ∥ψ∥2=⟨Rψ,ψ⟩≥0 by positivity, while injectivity rules out μ=0; hence every nonzero eigenvalue is positive.

1.2F4algebra

The domains defined by the squared coefficient sums for En and λn=En−(C0+1) coincide. Indeed λn2≤2En2+2(C0+1)2,En2≤2λn2+2(C0+1)2. Multiplying by ∣cn∣2 and summing preserves finiteness in both directions because ∑n∣cn∣2=∥u∥22<∞ by [F4]. This proves the displayed coefficient-domain description of D(h).

2.1A1F1F2F3step 1.1algebra

Each eigenspace is finite-dimensional by [F2], and so has an orthonormal basis by [F3]. The set of nonzero eigenvalues is at most countable, and [A1] selects these finite bases; their union is an orthonormal family whose closed span is HN by step 1.1. The space is infinite-dimensional: the indicators of the pairwise disjoint unit cubes [r,r+1)×[0,1)N−1, r∈N, are nonzero mutually orthogonal L2 vectors. Thus the family can be indexed by n≥1. The bound ∥R∥≤12 gives 0<μn≤12 and En≥1. The compact spectral theorem says only finitely many eigenvalues satisfy μ≥ε for each ε>0; recursively taking a largest remaining eigenvalue (which exists because above half its positive supremum there are only finitely many) orders them nonincreasingly with multiplicity and gives μn→0, hence En→∞.

3.1F4F7step 1.1step 2.1algebra

The family (ψn) is complete by step 1.1, so [F4] gives u=∑n⟨u,ψn⟩ψn in norm for every u∈HN and Parseval. In particular D(S) is dense because it contains all finite linear combinations of the ψn. Since each En is real, the diagonal formula for S gives ⟨Su,v⟩=⟨u,Sv⟩ for finite sums, and then for all u,v∈D(S) by [F7] and convergence of the coefficient series; thus S is symmetric. For u∈D(S) with coefficients cn, Cauchy--Schwarz [F7] makes ∑nEn∣cn∣2 absolutely convergent, and step 2.1 gives En≥1, so ⟨Su,u⟩=∑nEn∣cn∣2≥∑n∣cn∣2=∥u∥22.

4.1F4F5F7step 3.1algebra

To compute the adjoint domain, let v=∑ndnψn∈D(S∗) and write S∗v=z=∑nznψn. Testing the adjoint identity on each ψn gives zn=Endn. Because z∈HN, Parseval gives ∑nEn2∣dn∣2<∞, so v∈D(S). Conversely, if this sum is finite, then z:=∑nEndnψn∈HN and the coefficient identity ⟨Su,v⟩=⟨u,z⟩ holds first for finite sums and then for every u∈D(S) by [F7]; hence v∈D(S∗) and S∗v=Sv. Therefore D(S∗)=D(S) and S∗=S as operators; by the unbounded self-adjointness definition in [F5], S is self-adjoint.

4.2F1F4step 2.1step 3.1algebra

For f=∑nfnψn∈HN, boundedness of R and its action on each eigenvector give Rf=∑nμnfnψn. Since Enμn=1−μn∈[0,1], we have ∑nEn2∣μnfn∣2≤∑n∣fn∣2<∞, so Rf∈D(S) and (S+I)Rf=f. Conversely, for u=∑ncnψn∈D(S), R(S+I)u=∑nμn(En+1)cnψn=u. Thus S+I:D(S)→HN is bijective with bounded inverse R, which is compact by [F1].

5.1F1F4F6step 1.1step 2.1step 4.2algebra

The variational identity for R, applied to f=ψn, gives a(v,Rψn)=⟨v,ψn⟩ for every v∈Q. Since Rψn=μnψn and μn>0, each ψn lies in Q and a(v,ψn)=μn−1⟨v,ψn⟩. Thus ξn:=μn ψn is an orthonormal family in Q. If v∈Q is orthogonal in a to every ξn, the displayed identity makes all HN coefficients ⟨v,ψn⟩ zero. The HN completeness of (ψn) and injectivity of Q↪HN force v=0 in Q. Hence (ξn) is complete in Q, and Parseval in (Q,a) gives a(v,v)=∑nμn−1∣⟨v,ψn⟩∣2=∑n(En+1)∣⟨v,ψn⟩∣2.

5.2F1F7step 4.2algebra

Let u∈Cc∞ and set f:=(−∑jaj∂j2+W+1)u∈HN. Integration by parts gives a(u,v)=⟨f,v⟩ for v∈Cc∞; both sides are continuous in v for the Q norm by [F7], and Cc∞ is dense in Q, so the identity holds for all v∈Q. It is the defining variational identity for Rf, and uniqueness in [F1] gives Rf=u. Hence u∈ran⁡R=D(S) and (S+I)u=f, so Su=−∑jaj∂j2u+Wu.

6.1step 5.1F4algebra

Parseval in HN gives ∥v∥22=∑n∣⟨v,ψn⟩∣2. Subtracting (C0+2) times this identity from step 5.1 yields the claimed formula for qh(v), because En+1−(C0+2)=En−C0−1=λn.

6.2F2step 5.1algebra

If u∈D(h)=D(S) and cn=⟨u,ψn⟩, then ∑nEn2∣cn∣2<∞ by the definition of D(S). Since En≥1, En+1≤2En2, so ∑n(En+1)∣cn∣2<∞. Step 5.1 therefore gives u∈Q. Thus every eigenvector, and indeed every operator-domain vector, belongs to the form domain.

7.1F1F2F7step 2.1step 4.2step 5.2∎

Subtracting the real scalar (C0+1)I preserves self-adjointness on the same domain, and En≥1 gives eigenvalues λn=En−C0−1≥−C0. For u∈D(h), the diagonal expansion and Cauchy--Schwarz [F7] make ⟨hu,u⟩=∑nλn∣⟨u,ψn⟩∣2 absolutely convergent; Parseval then gives ⟨hu,u⟩≥−C0∥u∥22. The lowest eigenvalue corresponds to the largest eigenvalue μ1 of R; its eigenspace is nonzero and finite-dimensional by [F2]. Since W=V+C0+1, step 5.2 shows that h=S−(C0+1)I extends the specified polynomial differential expression. Finally h+(C0+2)I=S+I, whose inverse is the compact operator R by step 4.2. These statements establish the declared realization and all listed scope limits.

Depends on

Dependency tree · 2 levels

Sources