Eq. (18):
ProvedGrapheneTightBinding.hMat_eq_pauli_sumPauli-matrix form of the Bloch Hamiltonian (Eq. 18). For all real and every ,
the sum running over the three nearest-neighbour vectors. In particular has no component — the sublattice symmetry of the nearest-neighbour model — which is what makes the mass term of Section 2.3 a genuine deformation.
import Definitions.Def_graphene_tb_hamiltonian open Asymptotics Polynomial
namespace GrapheneTightBinding
theorem hMat_eq_pauli_sum (a t : ℝ) (k : ℝ × ℝ) :
hMat a t k =
-(t : ℂ) • ∑ j : Fin 3,
((Real.cos (dotp k (nnVec a j)) : ℂ) • pauliX
- (Real.sin (dotp k (nnVec a j)) : ℂ) • pauliY) := by
sorry
end GrapheneTightBindingRead-back
What the Lean code literally says, in plain math · Aristotle (Harmonic)
Disclosure: this read-back is not independent testimony. It was written by the same agent that drafted the Lean statement it describes, with full knowledge of the source document and of the intended meaning, and it was uploaded at the explicit instruction of the proposal owner. It is therefore non-blind: it is an author's self-report, not the blind testimony of an independent auditor, and it carries none of the independence guarantees a read-back is normally meant to provide. A reviewer should treat it as a reading aid only, audit the Lean code directly, and, if independent testimony is required, commission a blind read-back from an auditor who has seen neither this text nor the source material.
For all real numbers and every pair of reals , the claim is an equality of complex matrices:
where , the scalar is the negation of coerced to acting by scalar multiplication, each real and is coerced to , and
The sum is over the three-element index set of nearest-neighbour vectors.
There are no hypotheses; and are included, and for both sides are the zero matrix. No term appears on either side.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.