Skip to content

Basis Construction, Symmetry Sectors, and Matrix Elements

A trustworthy truncated matrix is built by enumerating each normalized state once, resolving exact symmetry sectors before diagonalization, removing null directions in the correct inner product, and verifying interaction and observable matrix elements against analytic small-sector cases. Sparse storage and a converged eigensolver come only after these algebraic checks; neither can detect a duplicated bosonic state, a missing combinatorial factor, or a broken constraint.

Required background. Hilbert-Space Truncation as a Regulator supplies PΛP_\Lambda and the omitted subspace. Representations, Intertwiners, Invariants, and Tensor Decomposition supplies irreducible sectors, invariant tensors, and multiplicities.

Helpful background. Multiplets, Invariants, and Selection Rules supplies the group-theoretic rules used to predict zero blocks.

Normalized basis states precede matrix assembly

Section titled “Normalized basis states precede matrix assembly”

Basis construction contract. Fix the one-particle modes and their inner product; a canonical representative for every many-particle state; exact momentum, charge, parity, and irrep labels; the cutoff rule; null-state and constraint removal; operator ordering; and the Gram matrix. Record expected block dimensions independently of the Hamiltonian builder.

For a real scalar of mass m>0m>0 on a circle of length LL,

kn=2πnL,ωn=m2+kn2,ϕ(x)=nZaneiknx+aneiknx2Lωn,k_n=\frac{2\pi n}{L}, \qquad \omega_n=\sqrt{m^2+k_n^2}, \qquad \phi(x)=\sum_{n\in\mathbb Z} \frac{a_ne^{ik_nx}+a_n^\dagger e^{-ik_nx}} {\sqrt{2L\omega_n}},

with [an,am]=δnm[a_n,a_m^\dagger]=\delta_{nm}. A normalized occupation basis is

{Nn}=n(an)NnNn!0.|\{N_n\}\rangle= \prod_n\frac{(a_n^\dagger)^{N_n}}{\sqrt{N_n!}}|0\rangle.

The free-energy, momentum, and field-parity labels are

E(0)=nωnNn,P=nknNn,PZ2=(1)nNn.E^{(0)}=\sum_n\omega_nN_n, \qquad P=\sum_n k_nN_n, \qquad \mathcal P_{\mathbb Z_2}=(-1)^{\sum_nN_n}.

Thus a zero-momentum even-sector basis at cutoff EmaxE_{\max} consists of every integer tuple satisfying E(0)EmaxE^{(0)}\le E_{\max}, nnNn=0\sum_n nN_n=0, and nNn\sum_nN_n even. An occupation tuple is already an unordered bosonic state. Generating ordered particle lists and retaining every permutation would duplicate it. This finite-volume scalar basis and its energy-cutoff organization are given explicitly in Rychkov and Vitale 2015, § 2.

When states i|i\rangle are not orthonormal—common for composite-operator or conformal bases—the Gram matrix Gij=ijG_{ij}=\langle i|j\rangle is part of the problem. Physical coefficients satisfy

Hc=EGc.Hc=EGc.

Null directions of GG must be removed or quotiented before solving. Replacing this by an ordinary eigenproblem changes both energies and normalization. A unitary target requires GG to be positive definite after the null quotient. A deliberately nonunitary benchmark must instead state the signature of its bilinear form and cannot inherit positivity-based variational bounds. A conformal-truncation treatment of Gram matrices, null-state removal, and the resulting generalized eigenproblem appears in Hogervorst, Rychkov, and van Rees 2015, §§ 3–4.

Exact symmetries determine blocks and zeros

Section titled “Exact symmetries determine blocks and zeros”

If U(g)U(g) is an exact symmetry and both HH and PΛP_\Lambda commute with it, the retained space decomposes as

PΛH=α(CmαVα),P_\Lambda\mathcal H =\bigoplus_{\alpha} \left(\mathbb C^{m_\alpha}\otimes V_\alpha\right),

where VαV_\alpha is an irrep and mαm_\alpha its multiplicity. Schur’s lemma then fixes the representation-space structure of an invariant Hamiltonian; only multiplicity spaces require nontrivial diagonalization. For an operator ORO_R transforming in representation RR, a matrix element vanishes unless VβV_\beta occurs in RVαR\otimes V_\alpha.

This is both a reduction and an exact test. A forbidden nonzero element signals an indexing, phase, tensor, or truncation error. A missing allowed element is not automatically an error, but it deserves an independent calculation.

Gauge theory requires a stronger choice. One may construct only gauge-singlet states, or keep a larger space with Gauss-law projectors and constraints. The method and residual constraint norm must be stated. The link and electric-flux bases are developed in Hamiltonian Lattice Field Theory; light-front momentum partitions and constrained fields are developed in DLCQ and Basis Light-Front Quantization. Neither should be silently replaced by an unconstrained Fock basis.

A scalar φ⁴ matrix has exact selection rules

Section titled “A scalar φ⁴ matrix has exact selection rules”

Consider

V=g4!0Ldx:ϕ4(x):.V=\frac{g}{4!}\int_0^L dx\,{:}\phi^4(x){:}.

Expanding the four fields produces monomials with zero through four creation operators. The spatial integral enforces exact integer momentum conservation. Normal ordering with respect to the declared H0H_0 fixes which contractions have already been absorbed into the mass and vacuum energy. The matrix element can change particle number by 0,±2,±40,\pm2,\pm4 and preserves Z2\mathbb Z_2 parity.

For each operator string, compute a canonical final occupation tuple and its ladder factor. For example,

aras{Nn}=(Nr+1)Ns,Nr+1,,Ns1,a_r^\dagger a_s|\{N_n\}\rangle =\sqrt{(N_r+1)N_s}\, |\ldots,N_r+1,\ldots,N_s-1,\ldots\rangle

for rsr\ne s. Repeated mode labels require the corresponding falling and rising factorials; treating four labels as distinct is a common source of factor errors.

Restrict temporarily to the zero mode and define X=a+aX=a+a^\dagger. In the ordered even basis (0,2,4)(|0\rangle,|2\rangle,|4\rangle),

:X4:=a4+4a3a+6a2a2+4aa3+a4{:}X^4{:} =a^{\dagger4}+4a^{\dagger3}a+6a^{\dagger2}a^2 +4a^\dagger a^3+a^4

has the exact matrix

(00240121632416372).\begin{pmatrix} 0&0&\sqrt{24}\\ 0&12&16\sqrt3\\ \sqrt{24}&16\sqrt3&72 \end{pmatrix}.

For the zero-mode contribution of the circle normalization above,

g4!0Ldx:ϕ04:=g96m2L:X4:.\frac{g}{4!}\int_0^L dx\,{:}\phi_0^4{:} =\frac{g}{96m^2L}{:}X^4{:}.

This matrix checks normalization, Hermiticity, normal ordering, parity, and repeated-mode combinatorics. It is a construction benchmark, not an approximation to the full interacting field theory unless all nonzero modes are deliberately removed from the target model.

Sparse assembly has a seven-step method contract

Section titled “Sparse assembly has a seven-step method contract”
  1. Enumerate independently. Generate canonical basis keys and verify small-cutoff counts with a second implementation or a generating function.
  2. Attach exact labels. Momentum, charge, parity, irrep, and constraint labels must be computable from the key without applying HH.
  3. Construct the metric. Confirm G=IG=I for normalized Fock states or find and remove null directions when GIG\ne I.
  4. Apply operator monomials. Act on a source state, compute the exact ladder and group-theory factor, canonicalize the target, and look it up once.
  5. Assemble each contribution separately. Keep H0H_0, each interaction, each counterterm, and every observable as independently testable matrices.
  6. Test identities. For covariant matrices Hij=iHjH_{ij}=\langle i|H|j\rangle, check H=HH^\dagger=H; equivalently, the one-index-raised operator A=G1HA=G^{-1}H must obey AG=GAA^\dagger G=GA. Then test exact commutators, forbidden blocks, analytic entries, finite traces or sum rules, and parameter derivatives such as H/g\partial H/\partial g.
  7. Only then solve. Report eigenpair residuals in the GG inner product and retain enough eigenvectors for the intended observables.

A sparse matrix can have no stored forbidden entries and still be incomplete. For small cutoffs, also construct a dense reference matrix by a different route and compare every entry.

In the shared map, basis construction controls the symmetry-complete retained branch. It does not eliminate the omitted branch; increasing a correct basis still changes induced interactions and effective observables.

A Hilbert-space cutoff splits retained and omitted states; omitted states induce effective Hamiltonians and observables, while symmetry, variational, residual, cross-basis, and held-out checks determine whether a plateau can support a certified limit

The symmetry-complete basis is one necessary branch of a controlled truncation. Exact block structure and matrix checks must join omitted-state corrections, effective observables, and cross-basis tests; monotone energy convergence alone does not certify a matrix element. The false-plateau branch is schematic and not to scale.

Required fields for a truncation result and the test that can falsify each field.
FieldRequired declarationIndependent testFailure signal
TargetHamiltonian, prior regulator, volume, boundary data, observableUnits and free or exact limitChanging target across cutoff points
ProjectorsPΛ, QΛ, all cutoff axes, limit orderState counts and nestednessUnidentified omitted states
Basis and sectorsNormalization, Gram matrix, null removal, exact chargesHermiticity and selection rulesDuplicates or broken constraints
Induced HamiltonianDerived operator basis and approximation orderOmitted-state toy model or perturbative coefficientDrift incompatible with the declared tail
CountertermsInputs, running coefficients, and no-double-counting ruleRefit protocol at every cutoffA fitted datum presented as a prediction
Variational statusManifold, optimizer, symmetry, bound hypothesesResidual, variance, and ansatz enlargementEnergy plateau with a large residual
Effective observablesProjected and induced operator termsSum rule or matched matrix elementSpectrum stable while the observable drifts
Cutoff sequenceIndependent basis, volume, counterterm, time, and state scansFixed-axis and cross-term fitsOnly one diagonal sequence
ExtrapolationAsymptotic form, fit window, covariance, alternativesWindow and model stabilityExponent chosen from the desired answer
Held-out testsUnused spectrum, matrix element, dynamics, and second basisBlind comparison after choices freezeAll tests participated in tuning
Adversarial enlargementLarger state and operator basesRepeat the full match and predictionFormer plateau moves beyond its error
ClaimBound, asymptotic evidence, empirical stability, or unresolvedError and cost reproduced independentlyPrecision exceeds the weakest test

Adversarial failure: Hermitian but duplicated

Section titled “Adversarial failure: Hermitian but duplicated”

Suppose a two-boson zero-momentum generator stores both ordered lists (n,n)(n,-n) and (n,n)(-n,n) for n0n\ne0 as independent states, then fills matrix elements symmetrically. The resulting matrix is Hermitian and its eigensolver residuals can be tiny. Nevertheless, the Hilbert space contains two copies of one physical occupation state, producing spurious degeneracies and incorrect transition strengths.

An independent occupation-tuple count exposes the duplication. Alternatively, construct symmetric normalized states explicitly and compare the small-sector matrix entry by entry. Hermiticity is necessary but cannot establish basis uniqueness.

  • Compare basis dimensions in every exact sector against an independent enumerator at several small cutoffs.
  • Verify that GG has the signature required by the declared theory after null removal—positive definite for a unitary Hilbert space. Test H=HH^\dagger=H and O=OO^\dagger=O for covariant matrix elements; for A=G1HA=G^{-1}H, test AG=GAA^\dagger G=GA instead.
  • Check exact charge and momentum commutators and every group-theoretically forbidden block.
  • Reproduce the one-mode :X4:{:}X^4{:} matrix, then test nonzero-momentum entries with repeated and distinct labels.
  • Confirm the free spectrum and degeneracies before switching on interactions.
  • Reserve at least one operator insertion that uses different selection rules from HH; a Hamiltonian-only check cannot validate it.
  • Repeat a final prediction in a second complete basis or truncation rule after matching the same physical inputs.

You should now be able to (1) enumerate a normalized symmetry-resolved scalar Fock basis without duplicates or null directions and (2) assemble and verify a sparse interaction or operator matrix using analytic selection rules and small matrices. Conformal and Hamiltonian Truncation applies these steps to UV operator states; Renormalizing a Truncated Hamiltonian supplies the induced matrix terms. Gauge-invariant bases return to Hamiltonian Lattice Field Theory.

Let m=1m=1, L=2πL=2\pi, and Emax=2E_{\max}=2. List the zero-momentum even states made only from modes n=0,±1n=0,\pm1 whose free energy does not exceed the cutoff. The vacuum energy is set to zero.

Solution

The mode energies are ω0=1\omega_0=1 and ω±1=2\omega_{\pm1}=\sqrt2. Even particle number and energy at most 22 allow the vacuum and two zero-mode quanta: 0|0\rangle and N0=2|N_0=2\rangle. The pair a1a10a_1^\dagger a_{-1}^\dagger|0\rangle has energy 22>22\sqrt2>2 and is excluded. One-particle states are odd under ϕϕ\phi\mapsto-\phi, and mixed zero/nonzero states fail momentum or parity. Thus the sector dimension is exactly two.

Show that 2:X4:4=163\langle2|{:}X^4{:}|4\rangle=16\sqrt3.

Solution

Only the term 4aa34a^\dagger a^3 lowers particle number by two. Acting on 4|4\rangle gives

4aa34=4432a1=42422=1632.4a^\dagger a^3|4\rangle =4\sqrt{4\cdot3\cdot2}\,a^\dagger|1\rangle =4\sqrt{24}\sqrt2\,|2\rangle =16\sqrt3\,|2\rangle.

All other normally ordered monomials change particle number by 4,0,2-4,0,2, or 44, so they do not contribute to this entry.

  • Hogervorst, Matthijs, Slava Rychkov, and Balt C. van Rees. “Truncated Conformal Space Approach in dd Dimensions: A Cheap Alternative to Lattice Field Theory?” Physical Review D 91, 025005 (2015). DOI.
  • Rychkov, Slava, and Lorenzo G. Vitale. “Hamiltonian Truncation Study of the ϕ4\phi^4 Theory in Two Dimensions.” Physical Review D 91, 085011 (2015). DOI.