Fermat's Last Theorem for polynomials
ProvedFamousTheorems.fermat_last_theorem_polynomialsFermat's Last Theorem for polynomials. Let be a field and with in . If are nonzero, and are coprime, and
then , and are all constant.
Unlike the integer case, this is elementary. It follows from the Mason–Stothers theorem (the theorem for polynomials). It is a standard illustration of how the function-field analogue of a hard arithmetic problem can be easy. The characteristic hypothesis is needed: in characteristic , .
Formalization note. Mathlib's Polynomial.flt. Coprimality is IsCoprime a b, and constancy is natDegree = 0.
Preamble
import Mathlib
Formal statement
namespace FamousTheorems
theorem fermat_last_theorem_polynomials {k : Type*} [Field k] {n : ℕ} (hn : 3 ≤ n) (hchar : (n : k) ≠ 0) {a b c : Polynomial k}
(ha : a ≠ 0) (hb : b ≠ 0) (hc : c ≠ 0) (hab : IsCoprime a b) (heq : a ^ n + b ^ n = c ^ n) :
a.natDegree = 0 ∧ b.natDegree = 0 ∧ c.natDegree = 0 := by sorry
end FamousTheoremsSource
Listed in Mathlib's curated theorem manifests (docs/1000.yaml); formalized in Mathlib as `Polynomial.flt`. Proof here reduces to that Mathlib result.