Direct sum of the three rational-place cubic spaces #
The manuscript uses
I₀ ⊕ I₁ ⊕ I∞, where Iθ = L ∧ rθ.
The eighteen packed rows below form a left inverse on the six quotient
coordinates of each summand. Their correctness is checked only on the
3 × 8 coordinate vectors and extended to arbitrary linear forms by
linearity. This compact certificate replaces repeated coordinate chases in
the quartic and annihilator arguments.
Packed covectors recovering six quotient coordinates at each rational place.
Equations
- One or more equations did not get rendered due to their size.
Instances For
Extract one coordinate from a three-form coordinate array.
Equations
- UnrestrictedBooleanMul.N4.threeFormCoordinate i j k = { toFun := fun (h : UnrestrictedBooleanMul.N4.ThreeForm) => h i j k, map_add' := ⋯, map_smul' := ⋯ }
Instances For
Wedge a linear form with the two-form of one rational place.
Equations
- One or more equations did not get rendered due to their size.
Instances For
Sum of the cubic contributions at the three rational places.
Equations
- UnrestrictedBooleanMul.N4.rationalCubicDirectSum M = ∑ theta : Fin 3, (UnrestrictedBooleanMul.N4.cubicPlaceLinear theta) (M theta)
Instances For
Six quotient coordinates for each of P₀, P₁, and P∞.
Equations
- One or more equations did not get rendered due to their size.
Instances For
A coordinate vector at one rational place, with zero inputs at the other places.
Equations
- UnrestrictedBooleanMul.N4.singleCubicInput theta j phi = if phi = theta then UnrestrictedBooleanMul.N4.coordinateLinear j else 0
Instances For
The three rational-place cubic spaces are a direct sum modulo their two-dimensional support kernels.