cyclic_orbit_poly_subspace_pow_mem
Given a field B, a field M which is an algebra over B, a natural number r, an element x ∈ M, and an index i : Fin r, x^(i : ℕ) is in cyclic_orbit_poly_subspace B r x.
Statement
theorem cyclic_orbit_poly_subspace_pow_mem {B M : Type*} [Field B] [Field M] [Algebra B M] (r : ℕ) (x : M) (i : Fin r) : x ^ (i : ℕ) ∈ cyclic_orbit_poly_subspace B r x
- Source
- arXiv:2611.04947 Section 3
- Verified
- 05 Nov 2026
- Axioms
Quot.soundpropext- Built on 1
- cyclic_orbit_poly_subspaceGiven a field B, a field M which is an algebra over B, a natural number r, and an element x ∈ M, cyclic_orbit_poly_subspace B r x is the…
- Used by 2
- cyclic_orbit_poly_subspace_one_memGiven a field B, a field M which is an algebra over B, a natural number r with 1 ≤ r, and an element x ∈ M, the element (1 : M) belongs to…
- cyclic_orbit_poly_subspace_fractional_linear_scaleGiven fields B and M with an algebra structure of M over B, a natural number r with 2 ≤ r, elements x, y ∈ M such that (minpoly B…
Read back from the Lean
Let $B$ and $M$ be fields such that $M$ is an algebra over $B$. For every natural number $r$, every element $x \in M$, and every $i \in \mathrm{Fin}(r)$ (that is, $i \in \mathbb{N}$ with $i < r$), the power $x^i$ belongs to $\mathrm{cyclic\_orbit\_poly\_subspace}(B, r, x)$.
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
By definition, `cyclic_orbit_poly_subspace B r x` is the $B$-linear span of the powers $x^j$ for indices $j < r$. For any index $i < r$, the power $x^i$ is directly an element of this generating set, and therefore belongs to the subspace.
$x^i$ belongs to the linear span of the set of powers $\{x^j \mid j < r\}$, which defines `cyclic_orbit_poly_subspace B r x`.
By definition, `cyclic_orbit_poly_subspace B r x` is the $B$-submodule spanned by the range of the map $j \mapsto x^j$ for $j \in \mathrm{Fin}\;r$. The element $x^i$ belongs to this range by `Set.mem_range_self`. Since any set is contained in the submodule it spans by `Submodule.subset_span`, $x^i$ is an element of the subspace.
uses
Submodule.subset_span,Set.mem_range_selfx ^ (i : ℕ) ∈ cyclic_orbit_poly_subspace B r x := Submodule.subset_span (Set.mem_range_self i)
Submodule.subset_span- Every subset of a module is contained in the submodule it spans.
Set.mem_range_self- For any function f and index i, the value f(i) belongs to the range of f.
- The definition of `cyclic_orbit_poly_subspace` as the linear span of the range of the map `fun i : Fin r => x ^ (i : ℕ)` is unfolded definitionally rather than by an explicit rewrite step.
Written by a model (gemini-3.8-flash) from the Lean source alone (no goal states were available). Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.
Lean source view module on GitHub
/-- x^i is in the polynomial subspace P_r(x) for i < r. -/theorem cyclic_orbit_poly_subspace_pow_mem {B M : Type*} [Field B] [Field M] [Algebra B M] (r : ℕ) (x : M) (i : Fin r) : x ^ (i : ℕ) ∈ cyclic_orbit_poly_subspace B r x := Submodule.subset_span (Set.mem_range_self i)