AFTD Auto-Formalizing Theoretical Domains

PMNSDiracEquivalence_refl

theoremverifiedformalizationimported Lean

The relation PMNSDiracEquivalence is reflexive.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Matrix Complex in
lemma PMNSDiracEquivalence_refl :
    ∀ U : unitaryGroup (Fin 3) ℂ, PMNSDiracEquivalence U U
Formalizes
Physlib, `PMNSDiracEquivalence_refl`
Lean proof
By Prabhoda Chandra Sarjapur, from github.com/leanprover-community/physlib at e411c6e89692 (Copyright (c) 2025 Prabhoda Chandra Sarjapur. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.34.1.
Verified
09 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 7
  • diagPhase_mullemma stating that multiplying two phase matrices is equivalent to adding the phases
  • diagPhaseShift_coe_matrixThe underlying matrix of the phase-shift element of the unitary group is the phase-shift matrix.
  • diagPhase_zerolemma stating that the diagonal phase matrix with all zeros is the identity matrix
  • diagPhasediagonal phase matrix from a real-valued function on indices
  • PMNSDiracEquivalenceThe Dirac PMNS matrix equivalence relations
  • diagPhase_starlemma stating that the Hermitian conjugate of diagPhase diag(+iθ_i) is just diagPhase with entries diag(-iθ_i)
  • diagPhase_zero_eqlemma stating that diagPhase with θ = 0 is equal to diagPhase with all zero phases

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen Matrix Complex in/-- The relation `PMNSDiracEquivalence` is reflexive. -/lemma PMNSDiracEquivalence_refl :    ∀ U : unitaryGroup (Fin 3) ℂ, PMNSDiracEquivalence U U := by    intro U    exact ⟨0, 0, by simp⟩
See it in the graphDiscuss this resultChallenge it