§3.2, Lemma sgp_right_scale
ProvedQAlgorithms.Papers.Independent.Dependency50.P27.sgp_right_scaleLet be a discrete totally ordered integral domain, with order compatible with its ring operations. For and , let take values in , and let be the sign of the first nonzero evaluation at among , with value zero if all vanish. Then
This describes scalar multiplication of the right sign.
import Definitions.Def_QAlgorithms_Papers_Independent_Dependency50_P27
namespace QAlgorithms.Papers.Independent.Dependency50.P27
noncomputable section
open Polynomial
/-- Source PDF p. 12, sgp_right_scale; ordered integral domains suffice. -/
theorem sgp_right_scale {R : Type*} [CommRing R] [IsDomain R]
[LinearOrder R] [IsStrictOrderedRing R] (c : R) (p : Polynomial R) (x : R) :
rightSign (c • p) x = sgr c * rightSign p x := by sorry
end
end QAlgorithms.Papers.Independent.Dependency50.P27
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every commutative integral domain equipped with a linear order making it a strictly ordered ring, every , every polynomial , and every , define to be , , or according as , , or . For a polynomial , define to be the first nonzero entry of , where is the natural degree of , taken as for the zero polynomial; set if all these entries are zero. The theorem asserts the integer equality
where is the polynomial obtained by multiplying every coefficient of by . This includes and , in either of which cases both sides are zero.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.