AFTD Auto-Formalizing Theoretical Domains

one_mem_polynomial_subspace

theoremverified

For any element x in L and any positive integer k, the identity element 1 belongs to the polynomial subspace $U_k(x)$.

Statement

theorem one_mem_polynomial_subspace (F : Type*) {L : Type*} [Field F] [Field L] [Algebra F L]
    {k : ℕ} (hk : 0 < k) (x : L) :
    (1 : L) ∈ polynomial_subspace F k x
Source
folklore
Verified
09 Nov 2026
Axioms
Quot.soundpropext
Built on 2
  • polynomial_subspaceFor an element x in an extension field L over F and an integer k, the polynomial subspace $U_k(x)$ is the F-span of the powers…
  • 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…

Read back from the Lean

Let F and L be fields such that L is an algebra over F. For any natural number k > 0 and any element x ∈ L, the multiplicative identity 1 ∈ L belongs to polynomial_subspace F k 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 $U_k(x)$ is the span of the powers $x^0, \dots, x^{k-1}$. Since $k > 0$, the zero-th power $x^0 = 1$ is in the generating set, and hence $1$ lies in the subspace. The proof applies the existing lemma `cyclic_orbit_poly_subspace_one_mem`, whose precondition $1 \le k$ is satisfied by the assumption $0 < k$.

  1. The identity element $1$ belongs to the polynomial subspace $U_k(x)$.

    We invoke `cyclic_orbit_poly_subspace_one_mem`, which establishes that $1$ lies in the polynomial subspace spanned by powers of $x$ whenever the exponent bound satisfies $1 \le k$. This leaves the single obligation $1 \le k$, which is discharged immediately by the hypothesis that $k$ is positive ($hk : 0 < k$).

    line 4

    uses cyclic_orbit_poly_subspace_one_mem

        (1 : L) ∈ polynomial_subspace F k x := by first | exact cyclic_orbit_poly_subspace_one_mem | (apply cyclic_orbit_poly_subspace_one_mem <;> assumption) | (apply cyclic_orbit_poly_subspace_one_mem <;> simp_all) | simpa using cyclic_orbit_poly_subspace_one_mem | (simp only [polynomial_subspace] at *; first | exact cyclic_orbit_poly_subspace_one_mem | (apply cyclic_orbit_poly_subspace_one_mem <;> assumption) | (apply cyclic_orbit_poly_subspace_one_mem <;> simp_all) | simpa using cyclic_orbit_poly_subspace_one_mem)
cyclic_orbit_poly_subspace_one_mem
For any field algebra $M$ over $B$, element $x \in M$, and integer $r \ge 1$, the identity element $1$ belongs to the subspace spanned by powers $x^0, \dots, x^{r-1}$.

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

/-- The element 1 belongs to the polynomial subspace U_k(x) for k ≥ 1. -/theorem one_mem_polynomial_subspace (F : Type*) {L : Type*} [Field F] [Field L] [Algebra F L]    {k : ℕ} (hk : 0 < k) (x : L) :    (1 : L) ∈ polynomial_subspace F k x := by first | exact cyclic_orbit_poly_subspace_one_mem | (apply cyclic_orbit_poly_subspace_one_mem <;> assumption) | (apply cyclic_orbit_poly_subspace_one_mem <;> simp_all) | simpa using cyclic_orbit_poly_subspace_one_mem | (simp only [polynomial_subspace] at *; first | exact cyclic_orbit_poly_subspace_one_mem | (apply cyclic_orbit_poly_subspace_one_mem <;> assumption) | (apply cyclic_orbit_poly_subspace_one_mem <;> simp_all) | simpa using cyclic_orbit_poly_subspace_one_mem)
See it in the graphDiscuss this resultChallenge it