cyclic_orbit_denom_ne_zero
If x ∈ M has minimal polynomial degree at least 2 over B and a, b, c, d ∈ B satisfy ad - bc ≠ 0, then cx + d ≠ 0 in M.
Statement
theorem cyclic_orbit_denom_ne_zero {B M : Type*} [Field B] [Field M] [Algebra B M] {x : M} (hx : 2 ≤ (minpoly B x).natDegree) (a b c d : B) (hdet : a * d - b * c ≠ 0) : algebraMap B M c * x + algebraMap B M d ≠ 0
- Source
- arXiv:2611.04947 Lemma 3.2
- Verified
- 05 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext- Used by 1
- 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$, and let $x \in M$. If the degree (natDegree) of the minimal polynomial of $x$ over $B$ is at least $2$, and if $a, b, c, d \in B$ satisfy $a \cdot d - b \cdot c \neq 0$, then $\iota(c) \cdot x + \iota(d) \neq 0$ in $M$, where $\iota : B \to M$ is the canonical algebra map (algebraMap B M).
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 proof proceeds by contradiction, assuming cx + d = 0 in M. If c = 0, then d = 0 by injectivity of the field embedding B → M, contradicting ad - bc ≠ 0. If c ≠ 0, solving for x reveals that x = -(c⁻¹d) lies in the base field B, meaning its minimal polynomial over B has degree 1, which contradicts the hypothesis that its degree is at least 2.
Assume for contradiction that cx + d = 0, and split into cases depending on whether c = 0.
We introduce the hypothesis that the denominator cx + d vanishes in M, and branch on whether the coefficient c ∈ B is zero or nonzero.
intro h by_cases hc : c = 0
The case c = 0 contradicts the determinant condition ad - bc ≠ 0.
When c = 0, the assumption cx + d = 0 simplifies to d = 0 in M using map_zero, zero_mul, and zero_add. Since any ring homomorphism from a field into a nontrivial ring is injective, d = 0 in B as well. Substituting c = 0 and d = 0 into the determinant yields ad - bc = 0, which contradicts hdet.
uses
map_zero,zero_mul,zero_add· subst hc simp only [map_zero, zero_mul, zero_add] at h have hd : d = 0 := (algebraMap B M).injective (by simpa using h) subst hd simp at hdet
The coefficient c is nonzero in M.
Since c ≠ 0 in the field B and the field homomorphism B → M is injective, the image of c in M cannot be zero.
· have hc' : algebraMap B M c ≠ 0 := by intro h0 exact hc ((algebraMap B M).injective (by simpa using h0))
The element x equals the image in M of -(c⁻¹ * d) ∈ B.
From cx + d = 0, we rewrite using eq_neg_iff_add_eq_zero to get cx = -d. Multiplying both sides by the inverse of c and applying associativity (mul_assoc), left cancellation (inv_mul_cancel₀), and the identity (one_mul) isolates x = c⁻¹ * (-d). Because the algebra map preserves negation (map_neg), multiplication (map_mul), and inversion (map_inv₀), algebraic rearrangement shows that x equals the image of -(c⁻¹ * d).
uses
eq_neg_iff_add_eq_zero,mul_assoc,inv_mul_cancel₀,one_mul,map_neg,map_mul,map_inv₀have hx_eq : x = algebraMap B M (-(c⁻¹ * d)) := by have hmul : algebraMap B M c * x = - algebraMap B M d := by rw [eq_neg_iff_add_eq_zero] exact h calc x = (algebraMap B M c)⁻¹ * (algebraMap B M c * x) := by rw [← mul_assoc, inv_mul_cancel₀ hc', one_mul] _ = (algebraMap B M c)⁻¹ * (- algebraMap B M d) := by rw [hmul] _ = algebraMap B M (-(c⁻¹ * d)) := by rw [map_neg, map_mul, map_inv₀] ring
The minimal polynomial of -(c⁻¹ * d) over B has degree 1.
Because x lies in the image of B under an injective algebra map, its minimal polynomial over B is the monic linear polynomial X - C(-(c⁻¹ * d)) by minpoly.eq_X_sub_C_of_algebraMap_inj. By Polynomial.natDegree_X_add_C (and map_mul), this linear polynomial has degree 1.
uses
minpoly.eq_X_sub_C_of_algebraMap_inj,Polynomial.natDegree_X_add_C,map_mulrw [hx_eq] at hx have hdeg : (minpoly B (algebraMap B M (-(c⁻¹ * d)))).natDegree = 1 := by rw [minpoly.eq_X_sub_C_of_algebraMap_inj (-(c⁻¹ * d)) (algebraMap B M).injective] simpa [map_mul] using Polynomial.natDegree_X_add_C (c⁻¹ * d)
A contradiction is reached between the degrees.
Substituting the computed degree 1 into the hypothesis that the minimal polynomial of x has degree at least 2 produces 2 ≤ 1, which norm_num refutes by basic numerical comparison.
rw [hdeg] at hx norm_num at hx
map_zero- A zero-preserving map sends zero to zero: f(0) = 0.
zero_mul- Multiplying zero by any element gives zero: 0 * b = 0.
zero_add- Adding zero on the left leaves an element unchanged: 0 + a = a.
eq_neg_iff_add_eq_zero- In an additive group, a = -b if and only if a + b = 0.
mul_assoc- Multiplication is associative: (a * b) * c = a * (b * c).
inv_mul_cancel₀- For any nonzero element in a group with zero, its inverse multiplied on the left gives one: a⁻¹ * a = 1.
one_mul- Multiplying by one on the left leaves an element unchanged: 1 * a = a.
map_neg- An additive group homomorphism preserves negation: f(-a) = -f(a).
map_mul- A multiplicative homomorphism preserves multiplication: f(x * y) = f(x) * f(y).
map_inv₀- A homomorphism between groups with zero preserves multiplicative inverses: f(a⁻¹) = (f(a))⁻¹.
minpoly.eq_X_sub_C_of_algebraMap_inj- For an injective algebra map A → B, the minimal polynomial of the image of a ∈ A is the linear polynomial X - C(a).
Polynomial.natDegree_X_add_C- The degree of the polynomial X + C(x) is 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
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 denominator cx + d is nonzero when x has degree at least 2 and ad - bc ≠ 0. -/theorem cyclic_orbit_denom_ne_zero {B M : Type*} [Field B] [Field M] [Algebra B M] {x : M} (hx : 2 ≤ (minpoly B x).natDegree) (a b c d : B) (hdet : a * d - b * c ≠ 0) : algebraMap B M c * x + algebraMap B M d ≠ 0 := by intro h by_cases hc : c = 0 · subst hc simp only [map_zero, zero_mul, zero_add] at h have hd : d = 0 := (algebraMap B M).injective (by simpa using h) subst hd simp at hdet · have hc' : algebraMap B M c ≠ 0 := by intro h0 exact hc ((algebraMap B M).injective (by simpa using h0)) have hx_eq : x = algebraMap B M (-(c⁻¹ * d)) := by have hmul : algebraMap B M c * x = - algebraMap B M d := by rw [eq_neg_iff_add_eq_zero] exact h calc x = (algebraMap B M c)⁻¹ * (algebraMap B M c * x) := by rw [← mul_assoc, inv_mul_cancel₀ hc', one_mul] _ = (algebraMap B M c)⁻¹ * (- algebraMap B M d) := by rw [hmul] _ = algebraMap B M (-(c⁻¹ * d)) := by rw [map_neg, map_mul, map_inv₀] ring rw [hx_eq] at hx have hdeg : (minpoly B (algebraMap B M (-(c⁻¹ * d)))).natDegree = 1 := by rw [minpoly.eq_X_sub_C_of_algebraMap_inj (-(c⁻¹ * d)) (algebraMap B M).injective] simpa [map_mul] using Polynomial.natDegree_X_add_C (c⁻¹ * d) rw [hdeg] at hx norm_num at hx