AFTD Auto-Formalizing Theoretical Domains

slow_mode_dephasing_zero

theoremverified

At time s = 0, the quantum slow-mode dephasing factor kappa_{n,m}(0) equals 1 for every n >= 2 and every m.

Statement

theorem slow_mode_dephasing_zero (n m : ℕ) (hn : 2 ≤ n) :
    slow_mode_dephasing n m 0 = 1
Source
arXiv:2609.13387
Verified
11 Nov 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 2
  • slow_mode_dephasingFor permutations in the symmetric group S_n, with H the average of left-regular permutation matrices for all m-cycles, kappa_{n,m}(s) is…
  • g$g(S,M) = \dim_{\mathbb{F}_p}(S^{\perp}_M) - \dim_{\mathbb{F}_p}(S_M)$.

Read back from the Lean

For all natural numbers $n$ and $m$, if $n \ge 2$, then slow_mode_dephasing n m 0 = 1.

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

The proof, explained

At time s = 0, the time-evolution matrix exp(-i · 0 · H) reduces to the identity matrix. In the sum over all permutations g in S_n, the transition amplitude from the identity to g vanishes for all g ≠ 1, leaving only the term g = 1. Since the identity permutation fixes all n elements and n ≥ 2, the normalization factor (n - 1)/(n - 1) equals 1, yielding kappa_{n,m}(0) = 1.

  1. For any Hamiltonian matrix H, the matrix exponential exp(-(i · 0) H) is the identity matrix 1.

    At time s = 0, the scalar factor -(i · 0) simplifies to 0. Multiplying H by 0 gives the zero matrix by zero_smul, and the exponential of the zero matrix is the identity matrix by NormedSpace.exp_zero.

    lines 10–11

    uses zero_smul, NormedSpace.exp_zero

      have hz : (- (Complex.I * (0 : ℂ)) : ℂ) = 0 := by simp
      rw [hz, zero_smul, NormedSpace.exp_zero]
  2. The sum defining the dephasing factor at time zero simplifies by replacing the matrix exponential with the identity matrix 1.

    We unfold the definition of slow_mode_dephasing_zero_sum and rewrite the matrix exponential using slow_mode_dephasing_zero_exp_zero, so each summand now involves the matrix entries of the identity matrix 1 rather than an exponential.

    lines 16–17

    uses slow_mode_dephasing_zero_exp_zero

      dsimp [slow_mode_dephasing_zero_sum]
      rw [slow_mode_dephasing_zero_exp_zero]
  3. Isolating the identity permutation g = 1 in the sum, its term evaluates to 1.

    We apply Finset.sum_eq_single to isolate the contribution of the identity permutation 1. By Matrix.one_apply and if_pos, the (1, 1) entry of the identity matrix is 1, so its squared norm is 1. The identity permutation fixes all n points, so the number of fixed points is n. Because n ≥ 2, the denominator n - 1 is nonzero by Nat.cast_le.mpr and linear arithmetic, so (n - 1) / (n - 1) = 1 by div_self. Thus the whole term simplifies to 1.

    lines 18–26

    uses Finset.sum_eq_single, Matrix.one_apply, if_pos, Nat.cast_le.mpr, div_self

      rw [Finset.sum_eq_single (1 : Equiv.Perm (Fin n))]
      · rw [Matrix.one_apply, if_pos rfl]
        have hfilt : ((Finset.filter (fun i : Fin n ↦ (1 : Equiv.Perm (Fin n)) i = i) Finset.univ).card : ℝ) = (n : ℝ) := by
          simp
        rw [hfilt]
        have hne : (n : ℝ) - 1 ≠ 0 := by
          have : (2 : ℝ) ≤ (n : ℝ) := Nat.cast_le.mpr hn
          linarith
        simp [div_self hne]
  4. Every term in the sum corresponding to a non-identity permutation b ≠ 1 is 0.

    For any permutation b ≠ 1, the (b, 1) entry of the identity matrix is 0 by Matrix.one_apply and if_neg. Its norm squared is 0, which zeroes out the entire summand.

    lines 27–29

    uses Matrix.one_apply, if_neg

      · intro b _ hb
        rw [Matrix.one_apply, if_neg hb]
        simp
  5. The identity permutation belongs to the universal finset of permutations.

    The third subgoal produced by Finset.sum_eq_single assumes for contradiction that 1 ∉ Finset.univ, which is immediately refuted because 1 ∈ Finset.univ by Finset.mem_univ.

    lines 30–31

    uses Finset.mem_univ

      · intro h
        exact (h (Finset.mem_univ 1)).elim
  6. The slow-mode dephasing factor kappa_{n,m}(0) equals 1 for every n ≥ 2 and every m.

    By definition, slow_mode_dephasing n m 0 is definitionally slow_mode_dephasing_zero_sum n H for the cycle Hamiltonian H. Applying slow_mode_dephasing_zero_sum_eq_one, which establishes this identity for an arbitrary matrix H, immediately completes the proof.

    line 36

    uses slow_mode_dephasing_zero_sum_eq_one

      exact slow_mode_dephasing_zero_sum_eq_one n hn _
zero_smul
The scalar multiple of any vector or matrix by zero is zero.
NormedSpace.exp_zero
The exponential of zero in a normed algebra is the identity element 1.
slow_mode_dephasing_zero_exp_zero
For any matrix H, the matrix exponential exp(-(i * 0) • H) equals the identity matrix 1.
Finset.sum_eq_single
A finite sum over a set reduces to the single term at a if every term for b ≠ a is zero, and the term at a is zero when a is not in the set.
Matrix.one_apply
The (i, j)-th entry of the identity matrix is 1 if i = j and 0 otherwise.
if_pos
An if-then-else expression reduces to the first branch when the condition is true.
Nat.cast_le.mpr
An inequality a ≤ b between natural numbers implies the corresponding inequality (a : ℝ) ≤ (b : ℝ) between real numbers.
div_self
Any nonzero element divided by itself equals 1.
if_neg
An if-then-else expression reduces to the second branch when the condition is false.
Finset.mem_univ
Every element of a finite type belongs to the universal finset univ.
slow_mode_dephasing_zero_sum_eq_one
For any n ≥ 2 and any matrix H, the dephasing sum at time zero equals 1.

Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.

Lean source view module on GitHub

noncomputable def slow_mode_dephasing_zero_sum (n : ℕ)    (H : Matrix (Equiv.Perm (Fin n)) (Equiv.Perm (Fin n)) ℂ) : ℝ :=  ∑ g : Equiv.Perm (Fin n),    ‖(NormedSpace.exp (- (Complex.I * (0 : ℂ)) • H)) g 1‖ ^ 2 *      ((((Finset.filter (fun i : Fin n ↦ g i = i) Finset.univ).card : ℝ) - 1) / ((n : ℝ) - 1))lemma slow_mode_dephasing_zero_exp_zero (n : ℕ)    (H : Matrix (Equiv.Perm (Fin n)) (Equiv.Perm (Fin n)) ℂ) :    NormedSpace.exp (- (Complex.I * (0 : ℂ)) • H) = 1 := by  have hz : (- (Complex.I * (0 : ℂ)) : ℂ) = 0 := by simp  rw [hz, zero_smul, NormedSpace.exp_zero]lemma slow_mode_dephasing_zero_sum_eq_one (n : ℕ) (hn : 2 ≤ n)    (H : Matrix (Equiv.Perm (Fin n)) (Equiv.Perm (Fin n)) ℂ) :    slow_mode_dephasing_zero_sum n H = 1 := by  dsimp [slow_mode_dephasing_zero_sum]  rw [slow_mode_dephasing_zero_exp_zero]  rw [Finset.sum_eq_single (1 : Equiv.Perm (Fin n))]  · rw [Matrix.one_apply, if_pos rfl]    have hfilt : ((Finset.filter (fun i : Fin n ↦ (1 : Equiv.Perm (Fin n)) i = i) Finset.univ).card : ℝ) = (n : ℝ) := by      simp    rw [hfilt]    have hne : (n : ℝ) - 1 ≠ 0 := by      have : (2 : ℝ) ≤ (n : ℝ) := Nat.cast_le.mpr hn      linarith    simp [div_self hne]  · intro b _ hb    rw [Matrix.one_apply, if_neg hb]    simp  · intro h    exact (h (Finset.mem_univ 1)).elim/-- At time s = 0, the slow-mode dephasing factor kappa_{n,m}(0) equals 1. -/theorem slow_mode_dephasing_zero (n m : ℕ) (hn : 2 ≤ n) :    slow_mode_dephasing n m 0 = 1 := by  exact slow_mode_dephasing_zero_sum_eq_one n hn _
See it in the graphDiscuss this resultChallenge it