finrank_Hn
theoremverifiedimported Lean
Complex dimension of the $n$-qubit space. For every natural number $n$, the $n$-qubit Hilbert space $\mathcal{H}_n$ has complex dimension $\dim_{\mathbb{C}}(\mathcal{H}_n) = 2^n$.
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 lemma finrank_Hn (n : ℕ) : Module.finrank ℂ (Hn n) = 2^n
- Source
- TCSlib, `finrank_Hn`
- 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.finrank_Hn← finrank_Hn (TCSlib/ErrorCorrectingCodes/QuantumHamming.lean:456): verbatim
- Verified
- 07 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- HnThe $n$-qubit Hilbert space $\mathcal{H}_n = \ell^2\!\bigl(\{0,1\}^n,\mathbb{C}\bigr)$, implemented as \texttt{EuclideanSpace ℂ (Fin n →…
- Used by 1
- 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…
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 linter.mathlibStandardSet false inopen scoped BigOperators inopen scoped Real inopen scoped Nat inopen scoped Classical inopen scoped Pointwise inset_option maxRecDepth 4000 inset_option synthInstance.maxHeartbeats 20000 inset_option synthInstance.maxSize 128 inset_option relaxedAutoImplicit false inset_option autoImplicit false inopen Complex Matrix in/-- The n-qubit Hilbert space `Hn n` has complex dimension 2^n. -/lemma finrank_Hn (n : ℕ) : Module.finrank ℂ (Hn n) = 2^n := by classical simp [Hn, finrank_euclideanSpace, Fintype.card_fin]