AFTD Auto-Formalizing Theoretical Domains

PauliMatrix.pauliMatrix

defimported Lean

The Pauli matrices.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Matrix in
open Complex in
open TensorProduct in
noncomputable def PauliMatrix.pauliMatrix : Fin 1 ⊕ Fin 3 → Matrix (Fin 2) (Fin 2) ℂ
Defined in
Physlib, `PauliMatrix.pauliMatrix`
Lean proof
By Joseph Tooby-Smith, from github.com/leanprover-community/physlib at e411c6e89692 (Copyright (c) 2024 Joseph Tooby-Smith. 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
none listed
Used by 5

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Matrix in
open Complex in
open TensorProduct in
/-- The Pauli matrices. -/
noncomputable def PauliMatrix.pauliMatrix : Fin 1 ⊕ Fin 3 → Matrix (Fin 2) (Fin 2) ℂ
  | Sum.inl 0 => 1
  | Sum.inr 0 => !![0, 1; 1, 0]
  | Sum.inr 1 => !![0, -I; I, 0]
  | Sum.inr 2 => !![1, 0; 0, -1]
See it in the graphDiscuss this resultChallenge it