Arithmetic of function fields

Number-theoretic analogues over F_q[T] and finite fields: polynomial primes, h-free polynomials, function-field adeles, positive-characteristic zeta values.

TheoremOdd perfect polynomials over \(\mathbb{F}_2\) are squares (Canaday)#✓fully proved

Let \(A\) be a polynomial over \(\mathbb{F}_2\) that is coprime to both \(X\) and \(X + 1\) (that is, odd: \(A\) has no linear factor) and that equals the sum of its monic divisors (that is, perfect). Then \(A\) is a square: \(A = B^2\) for some polynomial \(B\) over \(\mathbb{F}_2\).

Since every nonzero polynomial over \(\mathbb{F}_2\) is monic, the sum over monic divisors is the full divisor sum.

theorem odd_perfect_polynomial_is_square
    (A : Polynomial (ZMod 2))
    (hodd : IsCoprime A Polynomial.X ∧ IsCoprime A (Polynomial.X + 1))
    (hperfect : (finsum fun d : {d : Polynomial (ZMod 2) // d.Monic ∧ d ∣ A} =>
      (d : Polynomial (ZMod 2))) = A) :
    IsSquare A
Sources
  • Luis H. Gallardo and Olivier Rahavandrainy, "A Polynomial Variant of Perfect Numbers," Journal of Integer Sequences 23 (2020), Article 20.8.6, Lemma oddperfect, lines 155–158 (odd and perfect defined lines 96–108), https://cs.uwaterloo.ca/journals/JIS/VOL23/Gallardo/gallardo7.tex attributed there to Canaday.

The dependency explorer needs JavaScript and its graph data.

Download the complete graph data.