Alphabeta Math
LemmaStatement: 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.

Rotor interacting Hamiltonian with exact domain

Statement

Assume the model data of Exact compact U(1) rotor plus finite CAR data. The nonnegative electric operator H0=λE∑eEe2 is self-adjoint on the stated maximal diagonal domain and finite Fourier/occupation sums are a graph core. The finite plaquette and fermion interaction V=VB+VF is bounded and self-adjoint. Therefore H=H0+V is self-adjoint on exactly D(H0). Moreover H commutes with every gauge transformation U(α) on this domain. No continuum-limit assertion follows.

Facts & Assumptions

Given: The finite graph, joint Fourier/occupation basis, coefficients, operators, and domain in Exact compact U(1) rotor plus finite CAR data.

[F1]

Exact compact U(1) rotor plus finite CAR data: H0 is multiplication by λE∑ene2 on the maximal diagonal domain; Wp is a finite product of link multiplication unitaries; VB,VF are finite sums of the displayed plaquette and CAR terms. The model definition records the exact conditional statement and current draft status of its CAR supplier.

Proof

Given: The data and operator domains in [F1], with λE>0.

1.1F1givenalgebra

In the joint basis, H0 multiplies coefficients by the real nonnegative number h(n)=λE∑ene2. If ϕ∈D(H0∗) with H0∗ϕ=η, testing against each basis vector gives ηn,m=h(n)ϕn,m, so η∈Hkin forces ∑h(n)2∣ϕn,m∣2<∞ and ϕ∈D(H0). Conversely that weighted square summability and Cauchy–Schwarz give the adjoint identity. Hence H0∗=H0. Truncating a vector to finite subsets of the joint basis converges both in norm and in the H0 graph norm, so finite sums are a graph core.

2.1F1step 1.1algebra

Every Wp is unitary, so ∥Wp+Wp†∥≤2 and Wp+Wp† is self-adjoint. Each CAR operator has norm at most one by the conditional supplier in [F1]; every displayed fermion/link term is a finite sum of products of bounded operators, and pairing each term with its adjoint makes VF self-adjoint. Since the graph, plaquette list, site modes, and matrices are all finite-dimensional or finite in number, V is bounded and self-adjoint.

3.1F1step 2.1algebra

Let β>∥V∥ and z=±iβ. The diagonal resolvent R0(z)=(H0−z)−1 satisfies ∥R0(z)∥≤1/β, and H−z=(I+VR0(z))(H0−z). The Neumann series ∑k=0∞(−VR0(z))k converges in operator norm because ∥VR0(z)∥<1, so I+VR0(z) is onto and invertible. Thus both H−iβ and H+iβ are onto Hkin.

4.1step 3.1step 2.1algebra

On D(H0), H is densely defined and symmetric because H0 and V are. To prove self-adjointness directly, take y∈D(H∗) and choose x∈D(H) with (H+iβ)x=(H∗+iβ)y, using the surjectivity from step 3.1. Then y−x∈ker⁡(H∗+iβ)=Ran⁡(H−iβ)⊥={0}, again by step 3.1. Therefore D(H∗)⊆D(H); symmetry gives the reverse inclusion and H=H∗. Its domain is exactly the original D(H0) because the sum with bounded V was defined there.

5.1F1step 2.1algebra∎

Each U(α) is diagonal in the same Fourier/occupation basis as H0, so it preserves D(H0) and commutes with H0. The link relation [Ee,Ue]=Ue and the CAR relation [nx,cyβ]=−δxycyβ give U(α)UeU(α)†=ei(αs(e)−αt(e))Ue and U(α)cxβU(α)†=eiαxcxβ. A cycle's link phases telescope to 1; in a hopping term the phases multiply to e−iαs(e)ei(αs(e)−αt(e))eiαt(e)=1, and each onsite bilinear has phase e−iαxeiαx=1. Therefore U(α)VU(α)†=V and U(α)HU(α)†=H on D(H0).

Depends on

Dependency tree · 2 levels

Sources