A polynomial with integer coefficients and one common denominator.
Equations
Instances For
Interpret integer coefficient lists in the rational polynomial ring.
Equations
- HexPolyTheory.integerPolynomial xs = HexPolyTheory.polynomialOfList (List.map (fun (z : ℚ) => z) do let a ← xs pure ↑a)
Instances For
theorem
HexPolyTheory.blockPolynomial_add
(a b : Hex.Matrix.Lists.Scaled)
(ha : 0 < a.denom)
(hb : 0 < b.denom)
:
theorem
HexPolyTheory.blockPolynomial_sub
(a b : Hex.Matrix.Lists.Scaled)
(ha : 0 < a.denom)
(hb : 0 < b.denom)
:
theorem
HexPolyTheory.polynomialOfList_eq_block
(xs : List ℚ)
(a : Hex.Matrix.Lists.Scaled)
(ha : 0 < a.denom)
(h : Hex.Matrix.Lists.scaleRow a.denom xs a.nums = true)
:
Cross products identify a rational coefficient list with a block.