The two cyclotomic blocks are coprime when
ProvedOddPerfectNumber.Kernel.five_cyclotomic_coprime_first_mod_threeThe two non-linear cyclotomic blocks that appear in the Dris equation are
together with the linear factor . In the two-prime square-free-index case one has
so the odd-multiplicity prime support of every block must be contained in .
The counting theorem used to make that inference, two_prime_block_is_prime_mul_sq, requires the two blocks to be coprime, and the first-block instance of that coprimality has already been proved: for every odd prime .
The second-block instance is subtler. Writing gives
and the bracket is , so ; simultaneously , so . Hence the factor is common to and to , and indeed one has precisely when ; numerically over all primes below the gcd is for every and otherwise. So the unconditional second-block coprimality is false, and the hypothesis is exactly what removes the obstruction.
Under that hypothesis , hence and ; and every other prime dividing both blocks is ruled out by the same short Euclidean argument that proves the first-block case.
Consequence. This supplies the coprimality hypothesis that the second-block split five_two_prime_cyclotomic_split_second (target 793eb5c3-69c0-425d-b3b1-7f4719cfa0f1) needs in the case. In the case the factor must instead be handled by valuation, using the children three_val_second_cyclotomic and three_kernel_prime_when_p_two_mod_three.
import Mathlib
namespace OddPerfectNumber.Kernel
/-- If `p = 1 (mod 3)` then `(p^2 + p + 1)` and `((p + 1) / 2) * (p ^ 2 - p + 1)`
are coprime, and so are `(p ^ 2 - p + 1)` and `((p + 1) / 2) * (p ^ 2 + p + 1)`. -/
theorem five_cyclotomic_coprime_first_mod_three (p : Nat) (hp : p.Prime)
(hp2 : p != 2) (hp3 : p % 3 = 1) :
Nat.gcd (p ^ 2 + p + 1) (((p + 1) / 2) * (p ^ 2 - p + 1)) = 1 /\
Nat.gcd (((p + 1) / 2) * (p ^ 2 + p + 1)) (p ^ 2 - p + 1) = 1 := by
sorry
end OddPerfectNumber.Kernel