Cubic collapsibility when is represented by
ProvedCollapsibleCubics.cubic_collapsible_of_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 reachable half. It asserts that when the representation exists, is collapsible. The proof is short and constructive, and is given here in full so that the reader can judge the split rather than take it on trust. Given with , put
Then and by the computation above, so , and therefore
while is split by construction with . The Lean work is the packaging: the multiset of roots demanded by IsSplit, the degree of a product of three monic linear factors, and the symmetric-function identity.
What this half is worth. It is genuinely easier than the parent, not merely weaker — the argument above is complete. What it retires is the region of cubics that collapse in degree ; by the equivalence above that is exactly the region where a collapsing polynomial of degree exists at all. Examples: any with (take , ), and, less trivially, the root of , where gives .
Non-vacuity, checked and not asserted. Both halves of this split are inhabited, and both witnesses are machine-checked in Lean (including the irreducibility of the two cubics, via the rational root theorem). A root of satisfies this hypothesis (, take ); a root of satisfies its negation (, , so , which the positive-definite form never represents), and is the subject of the sibling node CollapsibleCubics.cubic_collapsible_of_not_normForm_repr.
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 (a non-integral element has minimal polynomial ). The coefficients and appear as (minpoly ℚ α).coeff 2 and (minpoly ℚ α).coeff 1; the division by is division in . The hypothesis is stated inline rather than through a new definition, in exactly the same words as in the sibling node, so that the two halves are visibly complementary.
import Definitions.Def_CollapsibleCubics_basic
namespace CollapsibleCubics
theorem cubic_collapsible_of_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