mem_cyclic_orbit_code_self
Every F-subspace U of L belongs to its own cyclic orbit code $\mathcal{C}_L(U)$.
Statement
theorem mem_cyclic_orbit_code_self (F : Type*) {L : Type*} [Field F] [Field L] [Algebra F L] (U : Submodule F L) : U ∈ cyclic_orbit_code F U
- Source
- folklore
- Verified
- 09 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- cyclic_orbit_codeFor a field F and an extension field L, the cyclic orbit code $\mathcal{C}_L(U)$ defined by an F-subspace $U \subseteq L$ is the set of…
Read back from the Lean
For any field $F$, field $L$ equipped with an $F$-algebra structure, and any $F$-submodule $U$ of $L$, $U$ is an element of cyclic_orbit_code F U.
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 cyclic orbit code consists of all subspace images a · U for non-zero scalars a in L. Taking a = 1, which is non-zero in any field, left multiplication by 1 is the identity map on L. Hence the image of U under multiplication by 1 is U itself, so U belongs to its cyclic orbit code.
The scalar 1 is non-zero and satisfies 1 · U = U, witnessing that U belongs to its cyclic orbit code.
By definition, the cyclic orbit code consists of all subspaces of the form a · U = Submodule.map (LinearMap.mulLeft F a) U for non-zero a ∈ L. We provide a = 1 as the witness. The element 1 is non-zero by one_ne_zero. To show that the image of U under left multiplication by 1 equals U, extensionality (ext) reduces the goal to showing that x ∈ 1 · U ↔ x ∈ U for all x ∈ L. The simplifier (simp) evaluates left multiplication by 1 as the identity linear map, which leaves U unchanged and closes the goal.
uses
one_ne_zeroU ∈ cyclic_orbit_code F U := ⟨1, one_ne_zero, by ext; simp⟩
one_ne_zero- In any nontrivial structure with 0 and 1 (such as a field), 1 is not equal to 0.
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.
/-- A subspace U belongs to its own cyclic orbit code. -/theorem mem_cyclic_orbit_code_self (F : Type*) {L : Type*} [Field F] [Field L] [Algebra F L] (U : Submodule F L) : U ∈ cyclic_orbit_code F U := ⟨1, one_ne_zero, by ext; simp⟩