PMNSDiracEquivalence_trans
theoremverifiedformalizationimported Lean
The relation PMNSDiracEquivalence is transitive.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Matrix Complex in lemma PMNSDiracEquivalence_trans {U V W : unitaryGroup (Fin 3) ℂ} : PMNSDiracEquivalence U V → PMNSDiracEquivalence V W → PMNSDiracEquivalence U W
- Formalizes
- Physlib, `PMNSDiracEquivalence_trans`
- 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.PMNSDiracEquivalence_trans← PMNSDiracEquivalence_trans (Physlib/Particles/NeutrinoPhysics/Basic.lean:111): verbatim
- Verified
- 09 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 8
- 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
- BoolFourier.fourier_coeff_convolutionConvolution theorem on the Boolean cube. Let $n$ be a natural number, and let $f, g : \{0,1\}^n \to \bbr$ be Boolean functions. Then for…
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
set_option autoImplicit true inset_option relaxedAutoImplicit true inopen Matrix Complex in/-- The relation `PMNSDiracEquivalence` is transitive. -/lemma PMNSDiracEquivalence_trans {U V W : unitaryGroup (Fin 3) ℂ} : PMNSDiracEquivalence U V → PMNSDiracEquivalence V W → PMNSDiracEquivalence U W := by rintro ⟨θ1, φ1, hUV⟩ ⟨θ2, φ2, hVW⟩ refine ⟨θ1 + θ2, φ1 + φ2, ?_⟩ simp only [hUV, hVW, ← mul_assoc, diagPhase_mul] simp [mul_assoc, diagPhase_mul, add_comm]