Keyboard shortcuts

Press ← or → to navigate between chapters

Press ? to show this help

Press Esc to hide this help

Unique minimum of the nearest-neighbor QES chain potential

Abstract

The nearest-neighbor QES chain potential has a unique minimum at its site configuration.

Definition 1.1 (The cyclic site equations).

Formalization. D5/S3/Quantum/SpinChains/NearestNeighborFreezingUniqueMinimum.Sites (✓ std3).

Citation. A. Enciso; F. Finkel; A. González-López; M. A. Rodríguez (2007). A novel quasi-exactly solvable spin chain with nearest-neighbors interactions. DOI: 10.1016/j.nuclphysb.2007.07.001. URL: https://arxiv.org/abs/0704.3046v1.

Commentary.

Sites ξ expresses Eq. (6). The cyclic successor is finRotate(N), and its inverse is the predecessor. StrictMono ξ imposes the increasing chamber separately; Fin N uses zero-based indices.

Definition 1.2 (The nearest-neighbor potential).

Formalization. D5/S3/Quantum/SpinChains/NearestNeighborFreezingUniqueMinimum.U (✓ std3).

Citation. A. Enciso; F. Finkel; A. González-López; M. A. Rodríguez (2007). A novel quasi-exactly solvable spin chain with nearest-neighbors interactions. DOI: 10.1016/j.nuclphysb.2007.07.001. URL: https://arxiv.org/abs/0704.3046v1.

Commentary.

The potential is Eq. (31), with r² = Σ_i x_i² and the two nearest-neighbor interaction sums.

Definition 1.3 (The unique-minimum claim).

Formalization. D5/S3/Quantum/SpinChains/NearestNeighborFreezingUniqueMinimum.claim (✓ std3).

Citation. A. Enciso; F. Finkel; A. González-López; M. A. Rodríguez (2007). A novel quasi-exactly solvable spin chain with nearest-neighbors interactions. DOI: 10.1016/j.nuclphysb.2007.07.001. URL: https://arxiv.org/abs/0704.3046v1.

Commentary.

The paper states after Eqs. (31)–(32), printed p. 13: “The first one is the requirement that ξ be the unique minimum of the potential U in the domain C. Although our numerical calculations suggest that this is indeed the case, we have not been able to provide a rigorous proof of this fact.” The encoding uses StrictMono on Fin N → ℝ and cyclic predecessor and successor indices.

Theorem 1.4 (The unique-minimum theorem).

Proof. Machine-checked in Lean as D5/S3/Quantum/SpinChains/NearestNeighborFreezingUniqueMinimum.result (✓ std3). ∎

Resolves. Problems/enciso-finkel-gonzalez-lopez-rodriguez-2007-freezing-unique-minimum (proved) by D5/S3/Quantum/SpinChains/NearestNeighborFreezingUniqueMinimum.result.

Source. Repository-derived.

Commentary.

For every N ≥ 3, the site configuration supplied by the theorem is the unique minimizer of U on the strictly increasing chamber.

References