Collapsibility is an affine invariant
ProvedCollapsibleCubics.collapsible_affineLet be a field containing , let be collapsible, and let with . Then
If is split with , the transformed polynomial is again split and sends into .
Applying the statement in both directions (to and to ) shows that collapsibility depends only on the -affine orbit of . Two consequences organise the whole problem. First, an arbitrary cubic may be replaced by a depressed one , since completing the cube is an affine change of variable. Second, the scaling sends to , so the question depends only on the invariant — reducing the search space from two rational parameters to one.
Formalization Note The conclusion asserts only that some split polynomial exists for ; no relation between the degrees or roots of the two witnesses is claimed, although the natural witness preserves both.
import Definitions.Def_CollapsibleCubics_basic
import Definitions.Def_CollapsibleCubics_basic
namespace CollapsibleCubics
theorem collapsible_affine {K : Type*} [Field K] [Algebra ℚ K] {α : K} (h : Collapsible α)
(l b : ℚ) (hl : l ≠ 0) :
Collapsible (algebraMap ℚ K l * α + algebraMap ℚ K b) := by sorry
end CollapsibleCubicsRead-back
What the Lean code literally says, in plain math · claude-opus-5
Fix a field that is equipped with the structure of a -algebra, so that there is a ring homomorphism (the structure map); is universally quantified (implicitly) over all types in an arbitrary universe carrying such a field and -algebra structure. Fix also an element , again an implicit universally quantified variable.
Call a rational polynomial split when both of the following hold:
- , where the degree here is the natural-number degree (so the zero polynomial and the nonzero constants, both of degree , are excluded); and
- there exist a rational number and a multiset of rational numbers with and
the product being taken over with multiplicity. Note is allowed to be the empty multiset, in which case the product is and is a nonzero constant — but such an is ruled out by the degree condition, so in effect must be nonempty. Nothing forces to equal the size of beyond what this equation itself imposes, and repeated roots are permitted.
Call an element collapsible when there exists a polynomial that is split in the above sense, together with a rational number , such that evaluating at (via the -algebra evaluation map, i.e. substituting for and mapping the rational coefficients into through ) yields the image of :
The rational number is existentially quantified, with no constraint on it; in particular is allowed, and the polynomial may depend on .
The statement asserts: for every such , every , and every pair of rational numbers and , if is collapsible and , then the element
is collapsible. Here and are explicit arguments ranging over all of , the hypothesis constrains only , and is entirely unconstrained (including ). The hypothesis that is collapsible is assumed, not derived, and the conclusion is a bare existence claim about some split rational polynomial and some rational constant for the transformed element — no relationship is asserted between the witnessing polynomial for and the witnessing polynomial for , and no claim is made about degrees, root sets, or the value being preserved. The conclusion is about the specific affine combination formed inside using multiplication and addition of , where the scalars enter as the images and of the rationals under the structure map.
Confirmed by the mission captain (proposal self-audit).