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.

Global unitary evolution at fixed finite regulator

Statement

Assume Countable Choice and let h be the self-adjoint operator of Self-adjoint unbounded polynomial interaction at fixed regulator, with complete orthonormal eigenfamily (ψn)n≥1 and real eigenvalues λn=En−C0−1. For t∈R define U(t)f:=∑n≥1e−itλn⟨f,ψn⟩ψn(f∈HN). Then the series converges in HN for every f; U(t) is unitary, U(0)=I, U(s+t)=U(s)U(t), and t↦U(t)f is norm-continuous for every f. Its norm derivative at any t exists exactly for f∈D(h), and then ddtU(t)f=−i hU(t)f. This is a mathematical one-parameter group with a dimensionless real parameter; it makes no physical unit or empirical claim.

Facts & Assumptions

Given: Countable Choice; HN; the self-adjoint h; its eigenvectors and real eigenvalues.

[A1]

The Axiom of Countable Choice (ACω): countable selections used in the eigenbasis construction are permitted.

[F1]

Self-adjoint unbounded polynomial interaction at fixed regulator: (ψn) is a complete orthonormal eigenfamily of h, hψn=λnψn, and D(h)={f:∑nλn2∣⟨f,ψn⟩∣2<∞}.

[F2]

Fourier expansion in a Hilbert space: expansions in the complete orthonormal family converge in norm and Parseval identifies the squared norm with the coefficient-square sum.

Proof

technique · direct

Given: f∈HN, its coefficients cn=⟨f,ψn⟩, and the real sequence (λn).

1.1A1F1F2algebra

Parseval gives ∑n∣cn∣2=∥f∥2. Since ∣e−itλn∣=1, the finite partial sums defining U(t)f are Cauchy in HN, so converge; Parseval gives ∥U(t)f∥2=∑n∣cn∣2=∥f∥2. The coefficient formula shows U(−t)U(t)f=f=U(t)U(−t)f and U(s)U(t)f=U(s+t)f, first on finite sums and then on all of HN by norm convergence and the norm bound. Thus U(t) is a surjective isometry, hence unitary, and U(0)=I.

1.2F2algebra

Fix s∈R and f∈HN. Given ε>0, choose a finite set F⊂N with ∑n∉F∣cn∣2<ε2/64, possible by convergence of the nonnegative series in [F2]. The norm of the difference on the complement is at most 2(∑n∉F∣cn∣2)1/2<ε/4. On the finite set F, each scalar e−itλn is continuous in t, so the finite partial difference has norm below 3ε/4 for t sufficiently close to s. The triangle inequality proves ∥U(t)f−U(s)f∥<ε, establishing strong continuity.

1.3F1F2algebra

Let f∈D(h), so ∑nλn2∣cn∣2<∞. Since ∣e−itλn∣=1, U(t)f has the same finite weighted coefficient sum and belongs to D(h). For r≠0, U(t+r)f−U(t)fr=∑ne−itλne−irλn−1rcnψn. The scalar integral identity e−irλ−1=∫0r(−iλ)e−isλ ds gives ∣(e−irλ−1)/r∣≤∣λ∣. Thus the difference quotient coefficients are dominated in square sum by λn2∣cn∣2. On each finite set they converge to −iλne−itλncn; choosing a finite set with small tail in that dominating series and then taking r→0 proves convergence in HN to −i∑nλne−itλncnψn=−ihU(t)f.

2.1F1F2F3algebra∎

Conversely, suppose the norm derivative at t=0 exists and equals g∈HN. Continuity of the coefficient functional v↦⟨v,ψn⟩ from [F3] makes its value on the difference quotient converge to −iλncn. Hence ⟨g,ψn⟩=−iλncn for every n. Parseval for g implies ∑nλn2∣cn∣2=∥g∥2<∞, so f∈D(h) by [F1]. If the derivative exists at any other t, the same coefficient argument multiplies each coefficient by a unit phase and yields the identical summability condition. Thus the differentiability domain is exactly D(h) at every t.

Depends on

Dependency tree · 2 levels

Sources