Lattice Hamiltonian constraints are second class
ProvedWheelerDeWittSuperspace.constraints_not_first_classLet , let each be , let be a physical configuration and two sites. Suppose the potential at depends on the metric at , in the sense that the symmetric part of is nonzero at . Then there are momenta such that every lattice constraint vanishes,
and yet
Hence the lattice constraints are not first class. Every finite-difference scalar curvature couples neighbouring sites, so this applies to every such discretization of the Wheeler–DeWitt constraint.
import Definitions.Def_WheelerDeWittSuperspace set_option autoImplicit false open Matrix
namespace WheelerDeWittSuperspace
/-- Goal (lattice constraints are second class): as soon
as the potential at `y` depends on the metric at a different site `x` (as for any
finite-difference curvature), there is a point on the constraint surface where the two
constraints do not Poisson-commute. -/
theorem constraints_not_first_class {X : Type*} [Fintype X] [DecidableEq X] (kappa Lam : ℝ)
(hkappa : kappa ≠ 0) (R : Config X → X → ℝ) (hR : ∀ z, ContDiff ℝ 1 (fun h => R h z))
(h : Config X) (hh : IsPhysical h) (x y : X) (hxy : x ≠ y)
(hdep : ∃ a b, partialR (fun h' => potentialAt kappa Lam R h' y) x a b h +
partialR (fun h' => potentialAt kappa Lam R h' y) x b a h ≠ 0) :
∃ p : Config X, (∀ z, classicalConstraint kappa Lam R z (h, p) = 0) ∧
poisson (classicalConstraint kappa Lam R x) (classicalConstraint kappa Lam R y) (h, p) ≠ 0 := by sorry
end WheelerDeWittSuperspace
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
Read-back of constraints_not_first_class.
Setting. Let be any finite type of "sites" with decidable equality. No lower bound on its size is assumed, but the hypothesis below forces . A configuration assigns to every site an arbitrary real array . All entries are independent real coordinates, and symmetry is not built in. Configuration space is a finite-dimensional real normed space. The phase space is , whose points are . Here the momentum is likewise an arbitrary real array at each site, which need not be symmetric.
Definitions used (unfolded). For a real matrix :
- , using the real square root. This returns when .
- The supermetric is
The division is total, so this is when .
Fix real numbers and a map , written .
- The potential at site is
- The classical constraint at site is the function on phase space
- For , the partial derivative is the Fréchet derivative of at , applied to the coordinate direction . That direction has entry at site , row , column , and everywhere else. The entries and are separate coordinates. If is not differentiable at , this value is by convention.
- The Poisson bracket of at is
Here is the Fréchet derivative on the product space, again defined as at points of non-differentiability. The sum runs over all 9 ordered index pairs, not only over symmetric combinations.
Hypotheses. The theorem quantifies over the following:
- , as above.
- Reals with .
- A map such that for every site the function is continuously differentiable () on all of , including non-physical configurations. Nothing else is assumed about . It need not be local, and it need not be related to any curvature.
- A configuration that is physical: for every site , the matrix is symmetric and positive definite. In particular and at every site.
- Two sites with .
- A dependence hypothesis: there exist indices such that
This is the symmetrized derivative of the potential at with respect to the metric entry at the other site . When it reads .
What the dependence hypothesis amounts to. Since , the factor does not change along . At the physical it is also differentiable and positive, and is differentiable. So the hypothesis is equivalent to
Put differently, at site must depend on the metric at site through a symmetrized derivative. A dependence only through the antisymmetric part does not satisfy it.
The hypothesis can be satisfied. For example, for all is and gives . So the hypotheses are jointly consistent whenever .
Conclusion. There exists a momentum configuration satisfying both of the following:
- Every constraint vanishes: for every site , at the given physical configuration .
- The bracket of the two constraints is nonzero:
The momentum ranges over arbitrary real arrays per site. It is not required to be symmetric, and nothing ties it to beyond condition 1. The existence of such a is itself part of what the theorem asserts. The configuration is fixed as the one given in the hypotheses, not chosen.
Remarks on the bracket. At a physical with of class , each is differentiable at . So the junk-value convention for derivatives does not apply here. depends on momenta only through , and its kinetic part depends only on . Because , the only terms of the bracket that can be nonzero are therefore
Not assumed. The statement does not involve , any symmetry requirement on , any locality or neighbour structure on , or any restriction on .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.