Cubic collapsibility when every collapsing polynomial has degree
OpenCollapsibleCubics.cubic_collapsible_of_not_normForm_reprLet be an algebraic number of degree and write its monic minimal polynomial over as
Where the degree- case sits. Suppose is split — degree , nonzero rational leading coefficient, all roots rational — and . Then . A nonzero polynomial of degree or cannot be divisible by the cubic , and is nonzero because ; so no collapsing polynomial has degree or . If then with the leading coefficient of , so is a monic split cubic for some ; conversely any monic split cubic congruent to a constant modulo collapses . Hence
Substituting removes the quadratic term and the two conditions collapse to a single one: writing , , ,
The left-hand side is the norm form of — the norm form of the Eisenstein integers . The right-hand side is , where is the depressed cubic obtained from by . So the hypothesis below says exactly: is represented over by , equivalently (classically) is a norm from , equivalently and every prime occurs in to an even exponent. Since the form is positive definite, is necessary; in particular every totally real cubic ( forces ) passes the sign test, and every cubic with fails it outright.
This statement — the honest residue. It asserts the parent's conclusion for the cubics that the sibling node CollapsibleCubics.cubic_collapsible_of_normForm_repr does not cover: those for which is not represented over by . By the equivalence derived above, the hypothesis says precisely:
Be clear about what the split does and does not buy. The sibling half is provable, so this node is logically equivalent to the parent, not weaker than it. The split does not reduce the problem; it locates it. What a solver gains is the extra hypothesis, and that hypothesis is usable in the strong sense: it is a concrete arithmetic condition on the two top coefficients of the minimal polynomial, checkable at sight, and it rules out the entire low-degree search in one line rather than by exhaustion.
Where the mission's own machinery lives. Since is positive definite, every cubic whose depressed form has satisfies this hypothesis. That includes — the smallest cubic still resisting, the subject of CollapsibleCubics.collapsible_x3_6x_1 — where and the mission's proved archimedean bound CollapsibleCubics.pi_div_psi_le_natDegree sharpens all the way to . The totally real cubics (, so ) split between the two halves according to whether is a norm from : the first genuinely non-archimedean obstruction available on this mission, and the place where CollapsibleCubics.even_card_roots_between applies.
Non-vacuity, checked and not asserted. This half is inhabited, and the witness is machine-checked in Lean: a root of has minimal polynomial (irreducibility via the rational root theorem), hence , , hence , which never equals. So this is not a conjecturally empty case. The complementary half is inhabited by a root of .
Formalization note. The hypothesis IsIntegral ℚ α is carried over verbatim from the parent so that the case split typechecks against it; it is redundant, since (minpoly ℚ α).natDegree = 3 already forces it. The negated existential is written inline, in exactly the same words as the positive form in the sibling node, so that the two halves are visibly complementary. Nothing here asserts that a collapsing polynomial of degree exists; as on the parent, a disproof — a cubic admitting no split at all — would refute the general conjecture, and this node should not be assumed true.
import Definitions.Def_CollapsibleCubics_basic
namespace CollapsibleCubics
theorem cubic_collapsible_of_not_normForm_repr (α : ℂ) (hint : IsIntegral ℚ α)
(hdeg : (minpoly ℚ α).natDegree = 3)
(hrep : ¬ ∃ r s : ℚ, r ^ 2 + r * s + s ^ 2
= ((minpoly ℚ α).coeff 2) ^ 2 / 3 - (minpoly ℚ α).coeff 1) :
Collapsible α := by sorry
end CollapsibleCubics