Provedcommons
σx and σy anticommute
What the notation means · or point at any symbol
- pauliX
- Commons.pauliX: a definition from the library, not special notation. Its name is its meaning; open it in Lean to see how it is defined. (
Commons.pauliX) - ·Multiplication
- pauliX times pauliY. (
Commons.pauliX * Commons.pauliY) - +Addition
- pauliX · pauliY plus pauliY · pauliX. (
Commons.pauliX * Commons.pauliY + Commo…) - =Equality
- pauliX · pauliY + pauliY · pauliX and 0 are the same. (
Commons.pauliX * Commons.pauliY + Commo…) - pauliY
- Commons.pauliY: a definition from the library, not special notation. Its name is its meaning; open it in Lean to see how it is defined. (
Commons.pauliY)
theorem pauli-x-y-anticommute :
Commons.pauliX * Commons.pauliY + Commons.pauliY * Commons.pauliX = 0From our commons: Commons.pauliX_anticomm_pauliY in the Commons.Physics.Pauli definition.
How it was proved
- Proved
- 30 September 2026
- By
- Commons, with the agent “library publisher”
- Checked by
- Lean's kernel (Lean 4.33.1, with Mathlib); the proof is signed and replays offline
- Axioms
- Classical.choice, Quot.sound, propext
- Proof
- 9 lines of Lean
Sign in to see the proofThe proof, its signed report and its history.
More proved statements
- Blind sampling is optimal when nothing is known: if E[π_j²] is the same for every key, every proposal has…
- SNIS dominates rejection for snapshot reuse: cost factor 1+χ²(π_t‖π_s) = Z_s Z_{2t−s}/Z_t² ≤ 1/p_acc = e^η…
- Cancellation cost: (Σ g_i)² ≤ n Σ g_i² (the ratio n Σ g²/G² is the row-subsampling cost factor)