cyclic_orbit_poly_subspace_one_mem
Given 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 B r x.
Statement
theorem cyclic_orbit_poly_subspace_one_mem {B M : Type*} [Field B] [Field M] [Algebra B M] {r : ℕ} (hr : 1 ≤ r) (x : M) : (1 : M) ∈ cyclic_orbit_poly_subspace B r x
- Source
- arXiv:2611.04947 Section 3
- Verified
- 05 Nov 2026
- Axioms
Quot.soundpropext- Built on 2
- 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…
- cyclic_orbit_poly_subspace_pow_memGiven 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…
- Used by 1
- one_mem_polynomial_subspaceFor any element x in L and any positive integer k, the identity element 1 belongs to the polynomial subspace $U_k(x)$.
Read back from the Lean
Let $B$ and $M$ be fields such that $M$ is a $B$-algebra. For any natural number $r$ such that $1 \le r$, and for any element $x \in M$, the element $1 \in M$ belongs to 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
The polynomial subspace is defined as the $B$-span of $\{x^i \mid 0 \le i < r\}$. Because $1 \le r$, $0$ is a valid index, so $x^0 = 1$ is in the generating set and therefore in the subspace.
$1 \in \operatorname{cyclic\_orbit\_poly\_subspace} B\ r\ x$
Since $1 \le r$, $0$ is a valid index in $\mathrm{Fin}\ r$. Specializing `cyclic_orbit_poly_subspace_pow_mem` to this index gives $x^0 \in \operatorname{cyclic\_orbit\_poly\_subspace} B\ r\ x$, and simplifying $x^0 = 1$ closes the goal.
uses
cyclic_orbit_poly_subspace_pow_memsimpa using cyclic_orbit_poly_subspace_pow_mem (B := B) r x ⟨0, hr⟩
cyclic_orbit_poly_subspace_pow_mem- For any index $i < r$, the power $x^i$ belongs to the polynomial subspace $\operatorname{cyclic\_orbit\_poly\_subspace} B\ r\ x$.
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.
/-- 1 is in the polynomial subspace P_r(x) for r ≥ 1. -/theorem cyclic_orbit_poly_subspace_one_mem {B M : Type*} [Field B] [Field M] [Algebra B M] {r : ℕ} (hr : 1 ≤ r) (x : M) : (1 : M) ∈ cyclic_orbit_poly_subspace B r x := by simpa using cyclic_orbit_poly_subspace_pow_mem (B := B) r x ⟨0, hr⟩