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 is self-adjoint on the stated maximal diagonal domain and finite Fourier/occupation sums are a graph core. The finite plaquette and fermion interaction is bounded and self-adjoint. Therefore is self-adjoint on exactly . Moreover commutes with every gauge transformation 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.
Exact compact U(1) rotor plus finite CAR data: is multiplication by on the maximal diagonal domain; is a finite product of link multiplication unitaries; 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 .
In the joint basis, multiplies coefficients by the real nonnegative number . If with , testing against each basis vector gives , so forces and . Conversely that weighted square summability and Cauchy–Schwarz give the adjoint identity. Hence . Truncating a vector to finite subsets of the joint basis converges both in norm and in the graph norm, so finite sums are a graph core.
Every is unitary, so and 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 self-adjoint. Since the graph, plaquette list, site modes, and matrices are all finite-dimensional or finite in number, is bounded and self-adjoint.
Let and . The diagonal resolvent satisfies , and The Neumann series converges in operator norm because , so is onto and invertible. Thus both and are onto .
On , is densely defined and symmetric because and are. To prove self-adjointness directly, take and choose with , using the surjectivity from step 3.1. Then , again by step 3.1. Therefore ; symmetry gives the reverse inclusion and . Its domain is exactly the original because the sum with bounded was defined there.
Each is diagonal in the same Fourier/occupation basis as , so it preserves and commutes with . The link relation and the CAR relation give and . A cycle's link phases telescope to ; in a hopping term the phases multiply to , and each onsite bilinear has phase . Therefore and on .