pauliStringsExactSupport
defimported Lean
The finset of all Pauli strings on $n$ qubits whose support equals exactly the given finset $S$.
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 pauliStringsExactSupport {n : ℕ} (S : Finset (Fin n)) : Finset (PauliString n)
- Defined in
- TCSlib, `pauliStringsExactSupport`
- 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.pauliStringsExactSupport← pauliStringsExactSupport (TCSlib/ErrorCorrectingCodes/QuantumHamming.lean:135): verbatim
- Verified
- 07 Oct 2026
- Axioms
- none listed
- Built on 3
- supportThe support $\mathrm{supp}(p) \subseteq \mathrm{Fin}\,n$ consists of coordinates where $p(i) \neq I$; the weight is…
- instFintypePauliStringinstFintypePauliString
- PauliStringA Pauli string of length $n$ is a function $p : \mathrm{Fin}\,n \to \mathrm{PauliBasis}$.
- Used by 2
- card_pauliStringsExactSupportNumber of Pauli strings with a prescribed support. Let $n$ be a natural number and let $S \subseteq \mathrm{Fin}\,n$ be a set of…
- 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…
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 Pauli strings with support exactly equal to `S`. -/ noncomputable def pauliStringsExactSupport {n : ℕ} (S : Finset (Fin n)) : Finset (PauliString n) := Finset.filter (fun p => support p = S) Finset.univ