PauliErrorsLe
defimported Lean
The set of all Pauli strings of weight at most $t$: \[ \mathcal{E}(n,t) = \bigl\{p : \mathrm{PauliString}\,n \;\big|\; \mathrm{wt}(p) \le t\bigr\}. \]
Statement
set_option linter.mathlibStandardSet false in open scoped BigOperators in open scoped Real in open scoped Nat in open scoped Classical in open scoped Pointwise in set_option maxRecDepth 4000 in set_option synthInstance.maxHeartbeats 20000 in set_option synthInstance.maxSize 128 in set_option relaxedAutoImplicit false in set_option autoImplicit false in open Complex Matrix in noncomputable def PauliErrorsLe (n t : ℕ) : Finset (PauliString n)
- Defined in
- TCSlib, `PauliErrorsLe`
- Lean proof
- By Allan Li, Hydroxyi (from the file's git history), from github.com/Shilun-Allan-Li/tcslib at
c8a02591b1e5(Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.25.0.PauliErrorsLe← PauliErrorsLe (TCSlib/ErrorCorrectingCodes/QuantumHamming.lean:102): verbatim
- Verified
- 07 Oct 2026
- Axioms
- none listed
- Built on 3
- instFintypePauliStringinstFintypePauliString
- weightThe support $\mathrm{supp}(p) \subseteq \mathrm{Fin}\,n$ consists of coordinates where $p(i) \neq I$; the weight is…
- PauliStringA Pauli string of length $n$ is a function $p : \mathrm{Fin}\,n \to \mathrm{PauliBasis}$.
- Used by 4
- quantum_hamming_bound_rawQuantum Hamming bound for non-degenerate codes. Let $C \le \mathcal{H}_n$ be a subspace of the $n$-qubit Hilbert space that is a…
- card_pauliErrorsLeCardinality of the bounded-weight Pauli error set. For natural numbers $n$ and $t$, the number of Pauli strings of length $n$ whose weight…
- error_sphere_dimensionDimension of the error sphere of a non-degenerate code. Let $C \le \mathcal{H}_n$ be a code on $n$ qubits that is non-degenerate for $t$…
- ErrorSphereThe error sphere $\mathrm{ES}(C,t)$ is the subspace $\bigvee_{\mathrm{wt}(p)\le t} \hat{p}(C)$, i.e.\ the supremum of the Pauli…
Lean source view module on GitHub
set_option linter.mathlibStandardSet false in open scoped BigOperators in open scoped Real in open scoped Nat in open scoped Classical in open scoped Pointwise in set_option maxRecDepth 4000 in set_option synthInstance.maxHeartbeats 20000 in set_option synthInstance.maxSize 128 in set_option relaxedAutoImplicit false in set_option autoImplicit false in open Complex Matrix in /-- The finset of all n-qubit Pauli strings of weight at most `t`. -/ noncomputable def PauliErrorsLe (n t : ℕ) : Finset (PauliString n) := Finset.filter (fun p => weight p ≤ t) Finset.univ /- Counting Paulis: canonical “choose support then assign X/Y/Z” approach. We introduce a 3-element type for non-identity Paulis. -/