Graphene's Dirac cone: , ,
ProvedGrapheneTightBinding.graphene_dirac_coneGoal: the Dirac cone of graphene. Let be the carbon–carbon distance and the nearest-neighbour hopping amplitude, and let
Then three things hold:
- Two bands . For every wave vector , the characteristic polynomial of is ; that is, the eigenvalues of the Bloch Hamiltonian are exactly .
- Gapless at the Dirac point. at : the two bands touch there.
- Conical dispersion. As ,
Together these say that the nearest-neighbour tight-binding model of graphene is a two-band semimetal whose bands meet at the Brillouin-zone corner and disperse linearly and isotropically around it with slope — the Dirac cone, and the origin of the massless-Dirac-fermion description of graphene's low-energy electrons.
import Definitions.Def_graphene_tb_hamiltonian open Asymptotics Polynomial
namespace GrapheneTightBinding
theorem graphene_dirac_cone (a t : ℝ) (ha : 0 < a) (ht : 0 < t) :
(∀ k : ℝ × ℝ, (hMat a t k).charpoly = X ^ 2 - C ((bandEnergy a t k : ℂ) ^ 2)) ∧
bandEnergy a t (diracK a) = 0 ∧
(fun q : ℝ × ℝ => bandEnergy a t (diracK a + q) - fermiVel a t * euclidNorm q)
=o[nhds (0 : ℝ × ℝ)] fun q : ℝ × ℝ => euclidNorm q := 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.
Assume and are real with and . Write for the structure factor of the honeycomb bundle, , , , and . The claim is a conjunction of three assertions.
-
For every pair of reals , the characteristic polynomial of the complex matrix equals , where the constant term is the real number coerced to and then squared. This is an identity of polynomials; it entails in particular that the matrix is traceless.
-
, an equality of real numbers.
-
The real-valued function
is little-o of as : for every there is a neighbourhood of the origin on which . Here is the componentwise sum and is the Euclidean length function of the lattice bundle (the ambient sup norm of the product type is not used).
Nothing is asserted about the second Dirac point , about eigenvectors, about any uniform or quantitative error bound, or about the behaviour for or . Part 3 alone would be compatible with being any function agreeing with to first order at ; it is parts 1 and 2 that tie to the spectrum of the Bloch Hamiltonian and fix its value at .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.