stabilizedSubspace_bot
For any natural number $n$, the stabilized subspace of the trivial subgroup $\bot \le (\mathrm{Matrix}\,(\mathrm{Fin}\,(2^n))\,(\mathrm{Fin}\,(2^n))\,\mathbb{C})^\times$ is the full module $\top$.
Statement
theorem stabilizedSubspace_bot (n : ℕ) : stabilizedSubspace n ⊥ = ⊤- Source
- arXiv:2610.37807 Definition 4
- Verified
- 08 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 2
- stabilizedSubspaceGiven a natural number $n$ and a subgroup $S \le (\mathrm{Matrix}\,(\mathrm{Fin}\,(2^n))\,(\mathrm{Fin}\,(2^n))\,\mathbb{C})^\times$, the…
- closed_network_end_node_response_boundFor any real numbers s and t with |s| ≤ 1 and |t| ≤ 1, |s + t| / 2 + |s - t| / 2 ≤ 1.
Read back from the Lean
For every natural number $n$, the stabilized subspace (in $\mathbb{C}^{2^n}$) associated with the trivial (bottom) subgroup of the group of invertible $2^n \times 2^n$ complex matrices is the entire vector space (the top submodule of $\text{Fin}(2^n) \to \mathbb{C}$).
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
The proof, explained
The stabilized subspace of a subgroup consists of all vectors fixed by every element in that subgroup. For the trivial subgroup ⊥, the only element is the identity matrix, which fixes every vector. Unfolding the definition of `stabilizedSubspace`, the condition that every element of ⊥ fixes v holds trivially for all v, so the subspace is the entire space ⊤.
The stabilized subspace of the trivial subgroup ⊥ is the entire space ⊤. automation
Unfolding the definition of `stabilizedSubspace`, the subspace consists of all vectors v fixed by every matrix s in the trivial subgroup ⊥ (that is, s v = v). Since ⊥ contains only the identity matrix, which acts trivially on all vectors, this membership condition is vacuously satisfied by every vector. The simplification engine (`simp`) reduces the carrier to the universal set and closes the goal that the submodule equals ⊤.
uses
closed_network_end_node_response_boundtheorem stabilizedSubspace_bot (n : ℕ) : stabilizedSubspace n ⊥ = ⊤ := by first | exact closed_network_end_node_response_bound | (apply closed_network_end_node_response_bound <;> assumption) | (apply closed_network_end_node_response_bound <;> simp_all) | simpa using closed_network_end_node_response_bound | (simp only [stabilizedSubspace] at *; first | exact closed_network_end_node_response_bound | (apply closed_network_end_node_response_bound <;> assumption) | (apply closed_network_end_node_response_bound <;> simp_all) | simpa using closed_network_end_node_response_bound)
closed_network_end_node_response_bound- For any real numbers s and t satisfying |s| ≤ 1 and |t| ≤ 1, the bound |s + t| / 2 + |s - t| / 2 ≤ 1 holds.
- The proof script originates from an automated search macro (using `first | ...`) and concludes with `simpa using closed_network_end_node_response_bound`. The lemma `closed_network_end_node_response_bound` is an unrelated bound on real numbers; `simpa` succeeds entirely because its initial `simp` pass simplifies the goal to `True`, without ever using the lemma.
Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.
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.
/-- The stabilized subspace of the trivial subgroup is the entire space. -/theorem stabilizedSubspace_bot (n : ℕ) : stabilizedSubspace n ⊥ = ⊤ := by first | exact closed_network_end_node_response_bound | (apply closed_network_end_node_response_bound <;> assumption) | (apply closed_network_end_node_response_bound <;> simp_all) | simpa using closed_network_end_node_response_bound | (simp only [stabilizedSubspace] at *; first | exact closed_network_end_node_response_bound | (apply closed_network_end_node_response_bound <;> assumption) | (apply closed_network_end_node_response_bound <;> simp_all) | simpa using closed_network_end_node_response_bound)