Is the root of collapsible? (any collapsing has degree )
ProvedCollapsibleCubics.collapsible_x3_6x_1Is the root of collapsible?
Call collapsible if there is some of degree , with nonzero rational leading coefficient and all roots rational, such that . The conjecture behind this mission is that every algebraic number is collapsible; the first open case is the cubic one. This theorem is the smallest cubic still resisting: no collapsing of a root of is known.
What is already established. This cubic has discriminant . Writing gives , , so with we get . A machine-checked archimedean bound (CollapsibleCubics.pi_div_psi_le_natDegree, a proved milestone of this mission) then forces
for every collapsing of this root. So this is not a gap that low-degree search can close: exhaustive checks at degree (up to height , denominator ) and extensive MILP searches found nothing, and provably could not have. Progress means exhibiting a witness of degree , or proving none exists.
Either resolution is significant. A collapsing would settle the smallest open case. A disproof — showing this root is not collapsible — would refute the general conjecture outright, so this statement is a genuine two-sided target and should not be assumed true.
The statement is given for in an arbitrary field containing , so it covers the root in , in , and in alike. Over itself the hypothesis is unsatisfiable (the cubic has no rational root), so the content is exactly the extension case.
import Definitions.Def_CollapsibleCubics_basic
namespace CollapsibleCubics
theorem collapsible_x3_6x_1 {K : Type*} [Field K] [Algebra ℚ K] (α : K)
(hα : α ^ 3 + algebraMap ℚ K 6 * α + algebraMap ℚ K 1 = 0) :
Collapsible α := by sorry
end CollapsibleCubics