P. 196 of Theorem List - Metamath Proof Explorer

Theorem List for Metamath Proof Explorer - 19501-19600   *Has distinct variable group(s)

Type	Label	Description
Statement
Theorem	mplmon2mul 19501*	Product of scaled monomials. (Contributed by Stefan O'Rear, 8-Mar-2015.)
|- P = ( I mPoly R )   &    |- D = { f e. ( NN0 ^m I ) | ( `' f " NN ) e. Fin }   &    |- .0. = ( 0g ` R )   &    |- C = ( Base ` R )   &    |- ( ph -> I e. W )   &    |- ( ph -> R e. CRing )   &    |- .xb = ( .r ` P )   &    |- .x. = ( .r ` R )   &    |- ( ph -> X e. D )   &    |- ( ph -> Y e. D )   &    |- ( ph -> F e. C )   &    |- ( ph -> G e. C )   =>    |- ( ph -> ( ( y e. D |-> if ( y = X , F , .0. ) ) .xb ( y e. D |-> if ( y = Y , G , .0. ) ) ) = ( y e. D |-> if ( y = ( X oF + Y ) , ( F .x. G ) , .0. ) ) )
Theorem	mplind 19502*	Prove a property of polynomials by "structural" induction, under a simplified model of structure which loses the sum of products structure. The commutativity condition is stronger than strictly needed. (Contributed by Stefan O'Rear, 11-Mar-2015.)
|- K = ( Base ` R )   &    |- V = ( I mVar R )   &    |- Y = ( I mPoly R )   &    |- .+ = ( +g ` Y )   &    |- .x. = ( .r ` Y )   &    |- C = (algSc ` Y )   &    |- B = ( Base ` Y )   &    |- ( ( ph /\ ( x e. H /\ y e. H ) ) -> ( x .+ y ) e. H )   &    |- ( ( ph /\ ( x e. H /\ y e. H ) ) -> ( x .x. y ) e. H )   &    |- ( ( ph /\ x e. K ) -> ( C ` x ) e. H )   &    |- ( ( ph /\ x e. I ) -> ( V ` x ) e. H )   &    |- ( ph -> X e. B )   &    |- ( ph -> I e. _V )   &    |- ( ph -> R e. CRing )   =>    |- ( ph -> X e. H )
Theorem	mplcoe4 19503*	Decompose a polynomial into a finite sum of scaled monomials. (Contributed by Stefan O'Rear, 8-Mar-2015.)
|- P = ( I mPoly R )   &    |- D = { f e. ( NN0 ^m I ) | ( `' f " NN ) e. Fin }   &    |- .0. = ( 0g ` R )   &    |- B = ( Base ` P )   &    |- ( ph -> I e. W )   &    |- ( ph -> R e. Ring )   &    |- ( ph -> X e. B )   =>    |- ( ph -> X = ( P gsumg ( k e. D |-> ( y e. D |-> if ( y = k , ( X ` k ) , .0. ) ) ) ) )
10.10.2  Polynomial evaluation
Syntax	ces 19504	Evaluation of a multivariate polynomial in a subring.
class evalSub
Syntax	cevl 19505	Evaluation of a multivariate polynomial.
class eval
Definition	df-evls 19506*	Define the evaluation map for the polynomial algebra. The function ( ( I evalSub S ) ` R ) : V --> ( S ^m ( S ^m I ) ) makes sense when I is an index set, S is a ring, R is a subring of S, and where V is the set of polynomials in ( I mPoly R ). This function maps an element of the formal polynomial algebra (with coefficients in R) to a function from assignments I --> S of the variables to elements of S formed by evaluating the polynomial with the given assignments. (Contributed by Stefan O'Rear, 11-Mar-2015.)
|- evalSub = ( i e. _V , s e. CRing |-> [_ ( Base ` s ) / b ]_ ( r e. (SubRing ` s ) |-> [_ ( i mPoly ( s ↾s r ) ) / w ]_ ( iota_ f e. ( w RingHom ( s ^s ( b ^m i ) ) ) ( ( f o. (algSc ` w ) ) = ( x e. r |-> ( ( b ^m i ) X. { x } ) ) /\ ( f o. ( i mVar ( s ↾s r ) ) ) = ( x e. i |-> ( g e. ( b ^m i ) |-> ( g ` x ) ) ) ) ) ) )
Definition	df-evl 19507*	A simplification of evalSub when the evaluation ring is the same as the coefficient ring. (Contributed by Stefan O'Rear, 19-Mar-2015.)
|- eval = ( i e. _V , r e. _V |-> ( ( i evalSub r ) ` ( Base ` r ) ) )
Theorem	evlslem4 19508*	The support of a tensor product of ring element families is contained in the product of the supports. (Contributed by Stefan O'Rear, 8-Mar-2015.) (Revised by AV, 18-Jul-2019.)
|- B = ( Base ` R )   &    |- .0. = ( 0g ` R )   &    |- .x. = ( .r ` R )   &    |- ( ph -> R e. Ring )   &    |- ( ( ph /\ x e. I ) -> X e. B )   &    |- ( ( ph /\ y e. J ) -> Y e. B )   &    |- ( ph -> I e. V )   &    |- ( ph -> J e. W )   =>    |- ( ph -> ( ( x e. I , y e. J |-> ( X .x. Y ) ) supp .0. ) C_ ( ( ( x e. I |-> X ) supp .0. ) X. ( ( y e. J |-> Y ) supp .0. ) ) )
Theorem	psrbagfsupp 19509*	Finite bags have finite nonzero-support. (Contributed by Stefan O'Rear, 9-Mar-2015.) (Revised by AV, 18-Jul-2019.)
|- D = { h e. ( NN0 ^m I ) | ( `' h " NN ) e. Fin }   =>    |- ( ( X e. D /\ I e. V ) -> X finSupp 0 )
Theorem	psrbagev1 19510*	A bag of multipliers provides the conditions for a valid sum. (Contributed by Stefan O'Rear, 9-Mar-2015.) (Revised by AV, 18-Jul-2019.)
|- D = { h e. ( NN0 ^m I ) | ( `' h " NN ) e. Fin }   &    |- C = ( Base ` T )   &    |- .x. = (.g ` T )   &    |- .0. = ( 0g ` T )   &    |- ( ph -> T e. CMnd )   &    |- ( ph -> B e. D )   &    |- ( ph -> G : I --> C )   &    |- ( ph -> I e. _V )   =>    |- ( ph -> ( ( B oF .x. G ) : I --> C /\ ( B oF .x. G ) finSupp .0. ) )
Theorem	psrbagev2 19511*	Closure of a sum using a bag of multipliers. (Contributed by Stefan O'Rear, 9-Mar-2015.) (Proof shortened by AV, 18-Jul-2019.)
|- D = { h e. ( NN0 ^m I ) | ( `' h " NN ) e. Fin }   &    |- C = ( Base ` T )   &    |- .x. = (.g ` T )   &    |- .0. = ( 0g ` T )   &    |- ( ph -> T e. CMnd )   &    |- ( ph -> B e. D )   &    |- ( ph -> G : I --> C )   &    |- ( ph -> I e. _V )   =>    |- ( ph -> ( T gsumg ( B oF .x. G ) ) e. C )
Theorem	evlslem2 19512*	A linear function on the polynomial ring which is multiplicative on scaled monomials is generally multiplicative. (Contributed by Stefan O'Rear, 9-Mar-2015.)
|- P = ( I mPoly R )   &    |- B = ( Base ` P )   &    |- .x. = ( .r ` S )   &    |- .0. = ( 0g ` R )   &    |- D = { h e. ( NN0 ^m I ) | ( `' h " NN ) e. Fin }   &    |- ( ph -> I e. _V )   &    |- ( ph -> R e. CRing )   &    |- ( ph -> S e. CRing )   &    |- ( ph -> E e. ( P GrpHom S ) )   &    |- ( ( ph /\ ( ( x e. B /\ y e. B ) /\ ( j e. D /\ i e. D ) ) ) -> ( E ` ( k e. D |-> if ( k = ( j oF + i ) , ( ( x ` j ) ( .r ` R ) ( y ` i ) ) , .0. ) ) ) = ( ( E ` ( k e. D |-> if ( k = j , ( x ` j ) , .0. ) ) ) .x. ( E ` ( k e. D |-> if ( k = i , ( y ` i ) , .0. ) ) ) ) )   =>    |- ( ( ph /\ ( x e. B /\ y e. B ) ) -> ( E ` ( x ( .r ` P ) y ) ) = ( ( E ` x ) .x. ( E ` y ) ) )
Theorem	evlslem6 19513*	Lemma for evlseu 19516. Finiteness and consistency of the top-level sum. (Contributed by Stefan O'Rear, 9-Mar-2015.) (Revised by AV, 26-Jul-2019.)
|- P = ( I mPoly R )   &    |- B = ( Base ` P )   &    |- C = ( Base ` S )   &    |- K = ( Base ` R )   &    |- D = { h e. ( NN0 ^m I ) | ( `' h " NN ) e. Fin }   &    |- T = (mulGrp ` S )   &    |- .^ = (.g ` T )   &    |- .x. = ( .r ` S )   &    |- V = ( I mVar R )   &    |- E = ( p e. B |-> ( S gsumg ( b e. D |-> ( ( F ` ( p ` b ) ) .x. ( T gsumg ( b oF .^ G ) ) ) ) ) )   &    |- ( ph -> I e. _V )   &    |- ( ph -> R e. CRing )   &    |- ( ph -> S e. CRing )   &    |- ( ph -> F e. ( R RingHom S ) )   &    |- ( ph -> G : I --> C )   &    |- ( ph -> Y e. B )   =>    |- ( ph -> ( ( b e. D |-> ( ( F ` ( Y ` b ) ) .x. ( T gsumg ( b oF .^ G ) ) ) ) : D --> C /\ ( b e. D |-> ( ( F ` ( Y ` b ) ) .x. ( T gsumg ( b oF .^ G ) ) ) ) finSupp ( 0g ` S ) ) )
Theorem	evlslem3 19514*	Lemma for evlseu 19516. Polynomial evaluation of a scaled monomial. (Contributed by Stefan O'Rear, 8-Mar-2015.)
|- P = ( I mPoly R )   &    |- B = ( Base ` P )   &    |- C = ( Base ` S )   &    |- K = ( Base ` R )   &    |- D = { h e. ( NN0 ^m I ) | ( `' h " NN ) e. Fin }   &    |- T = (mulGrp ` S )   &    |- .^ = (.g ` T )   &    |- .x. = ( .r ` S )   &    |- V = ( I mVar R )   &    |- E = ( p e. B |-> ( S gsumg ( b e. D |-> ( ( F ` ( p ` b ) ) .x. ( T gsumg ( b oF .^ G ) ) ) ) ) )   &    |- ( ph -> I e. _V )   &    |- ( ph -> R e. CRing )   &    |- ( ph -> S e. CRing )   &    |- ( ph -> F e. ( R RingHom S ) )   &    |- ( ph -> G : I --> C )   &    |- .0. = ( 0g ` R )   &    |- ( ph -> A e. D )   &    |- ( ph -> H e. K )   =>    |- ( ph -> ( E ` ( x e. D |-> if ( x = A , H , .0. ) ) ) = ( ( F ` H ) .x. ( T gsumg ( A oF .^ G ) ) ) )
Theorem	evlslem1 19515*	Lemma for evlseu 19516, give a formula for (the unique) polynomial evaluation homomorphism. (Contributed by Stefan O'Rear, 9-Mar-2015.) (Proof shortened by AV, 26-Jul-2019.)
|- P = ( I mPoly R )   &    |- B = ( Base ` P )   &    |- C = ( Base ` S )   &    |- K = ( Base ` R )   &    |- D = { h e. ( NN0 ^m I ) | ( `' h " NN ) e. Fin }   &    |- T = (mulGrp ` S )   &    |- .^ = (.g ` T )   &    |- .x. = ( .r ` S )   &    |- V = ( I mVar R )   &    |- E = ( p e. B |-> ( S gsumg ( b e. D |-> ( ( F ` ( p ` b ) ) .x. ( T gsumg ( b oF .^ G ) ) ) ) ) )   &    |- ( ph -> I e. _V )   &    |- ( ph -> R e. CRing )   &    |- ( ph -> S e. CRing )   &    |- ( ph -> F e. ( R RingHom S ) )   &    |- ( ph -> G : I --> C )   &    |- A = (algSc ` P )   =>    |- ( ph -> ( E e. ( P RingHom S ) /\ ( E o. A ) = F /\ ( E o. V ) = G ) )
Theorem	evlseu 19516*	For a given interpretation of the variables G and of the scalars F, this extends to a homomorphic interpretation of the polynomial ring in exactly one way. (Contributed by Stefan O'Rear, 9-Mar-2015.)
|- P = ( I mPoly R )   &    |- C = ( Base ` S )   &    |- A = (algSc ` P )   &    |- V = ( I mVar R )   &    |- ( ph -> I e. _V )   &    |- ( ph -> R e. CRing )   &    |- ( ph -> S e. CRing )   &    |- ( ph -> F e. ( R RingHom S ) )   &    |- ( ph -> G : I --> C )   =>    |- ( ph -> E! m e. ( P RingHom S ) ( ( m o. A ) = F /\ ( m o. V ) = G ) )
Theorem	reldmevls 19517	Well-behaved binary operation property of evalSub. (Contributed by Stefan O'Rear, 19-Mar-2015.)
|- Rel dom evalSub
Theorem	mpfrcl 19518	Reverse closure for the set of polynomial functions. (Contributed by Stefan O'Rear, 19-Mar-2015.)
|- Q = ran ( ( I evalSub S ) ` R )   =>    |- ( X e. Q -> ( I e. _V /\ S e. CRing /\ R e. (SubRing ` S ) ) )
Theorem	evlsval 19519*	Value of the polynomial evaluation map function. (Contributed by Stefan O'Rear, 11-Mar-2015.) (Revised by AV, 18-Sep-2021.)
|- Q = ( ( I evalSub S ) ` R )   &    |- W = ( I mPoly U )   &    |- V = ( I mVar U )   &    |- U = ( S ↾s R )   &    |- T = ( S ^s ( B ^m I ) )   &    |- B = ( Base ` S )   &    |- A = (algSc ` W )   &    |- X = ( x e. R |-> ( ( B ^m I ) X. { x } ) )   &    |- Y = ( x e. I |-> ( g e. ( B ^m I ) |-> ( g ` x ) ) )   =>    |- ( ( I e. Z /\ S e. CRing /\ R e. (SubRing ` S ) ) -> Q = ( iota_ f e. ( W RingHom T ) ( ( f o. A ) = X /\ ( f o. V ) = Y ) ) )
Theorem	evlsval2 19520*	Characterizing properties of the polynomial evaluation map function. (Contributed by Stefan O'Rear, 12-Mar-2015.) (Revised by AV, 18-Sep-2021.)
|- Q = ( ( I evalSub S ) ` R )   &    |- W = ( I mPoly U )   &    |- V = ( I mVar U )   &    |- U = ( S ↾s R )   &    |- T = ( S ^s ( B ^m I ) )   &    |- B = ( Base ` S )   &    |- A = (algSc ` W )   &    |- X = ( x e. R |-> ( ( B ^m I ) X. { x } ) )   &    |- Y = ( x e. I |-> ( g e. ( B ^m I ) |-> ( g ` x ) ) )   =>    |- ( ( I e. Z /\ S e. CRing /\ R e. (SubRing ` S ) ) -> ( Q e. ( W RingHom T ) /\ ( ( Q o. A ) = X /\ ( Q o. V ) = Y ) ) )
Theorem	evlsrhm 19521	Polynomial evaluation is a homomorphism (into the product ring). (Contributed by Stefan O'Rear, 12-Mar-2015.)
|- Q = ( ( I evalSub S ) ` R )   &    |- W = ( I mPoly U )   &    |- U = ( S ↾s R )   &    |- T = ( S ^s ( B ^m I ) )   &    |- B = ( Base ` S )   =>    |- ( ( I e. V /\ S e. CRing /\ R e. (SubRing ` S ) ) -> Q e. ( W RingHom T ) )
Theorem	evlssca 19522	Polynomial evaluation maps scalars to constant functions. (Contributed by Stefan O'Rear, 13-Mar-2015.) (Proof shortened by AV, 18-Sep-2021.)
|- Q = ( ( I evalSub S ) ` R )   &    |- W = ( I mPoly U )   &    |- U = ( S ↾s R )   &    |- B = ( Base ` S )   &    |- A = (algSc ` W )   &    |- ( ph -> I e. V )   &    |- ( ph -> S e. CRing )   &    |- ( ph -> R e. (SubRing ` S ) )   &    |- ( ph -> X e. R )   =>    |- ( ph -> ( Q ` ( A ` X ) ) = ( ( B ^m I ) X. { X } ) )
Theorem	evlsvar 19523*	Polynomial evaluation maps variables to projections. (Contributed by Stefan O'Rear, 12-Mar-2015.) (Proof shortened by AV, 18-Sep-2021.)
|- Q = ( ( I evalSub S ) ` R )   &    |- V = ( I mVar U )   &    |- U = ( S ↾s R )   &    |- B = ( Base ` S )   &    |- ( ph -> I e. W )   &    |- ( ph -> S e. CRing )   &    |- ( ph -> R e. (SubRing ` S ) )   &    |- ( ph -> X e. I )   =>    |- ( ph -> ( Q ` ( V ` X ) ) = ( g e. ( B ^m I ) |-> ( g ` X ) ) )
Theorem	evlval 19524	Value of the simple/same ring evaluation map. (Contributed by Stefan O'Rear, 19-Mar-2015.) (Revised by Mario Carneiro, 12-Jun-2015.)
|- Q = ( I eval R )   &    |- B = ( Base ` R )   =>    |- Q = ( ( I evalSub R ) ` B )
Theorem	evlrhm 19525	The simple evaluation map is a ring homomorphism. (Contributed by Mario Carneiro, 12-Jun-2015.)
|- Q = ( I eval R )   &    |- B = ( Base ` R )   &    |- W = ( I mPoly R )   &    |- T = ( R ^s ( B ^m I ) )   =>    |- ( ( I e. V /\ R e. CRing ) -> Q e. ( W RingHom T ) )
Theorem	evlsscasrng 19526	The evaluation of a scalar of a subring yields the same result as evaluated as a scalar over the ring itself. (Contributed by AV, 12-Sep-2019.)
|- Q = ( ( I evalSub S ) ` R )   &    |- O = ( I eval S )   &    |- W = ( I mPoly U )   &    |- U = ( S ↾s R )   &    |- P = ( I mPoly S )   &    |- B = ( Base ` S )   &    |- A = (algSc ` W )   &    |- C = (algSc ` P )   &    |- ( ph -> I e. V )   &    |- ( ph -> S e. CRing )   &    |- ( ph -> R e. (SubRing ` S ) )   &    |- ( ph -> X e. R )   =>    |- ( ph -> ( Q ` ( A ` X ) ) = ( O ` ( C ` X ) ) )
Theorem	evlsca 19527	Simple polynomial evaluation maps scalars to constant functions. (Contributed by AV, 12-Sep-2019.)
|- Q = ( I eval S )   &    |- W = ( I mPoly S )   &    |- B = ( Base ` S )   &    |- A = (algSc ` W )   &    |- ( ph -> I e. V )   &    |- ( ph -> S e. CRing )   &    |- ( ph -> X e. B )   =>    |- ( ph -> ( Q ` ( A ` X ) ) = ( ( B ^m I ) X. { X } ) )
Theorem	evlsvarsrng 19528	The evaluation of the variable of polynomials over subring yields the same result as evaluated as variable of the polynomials over the ring itself. (Contributed by AV, 12-Sep-2019.)
|- Q = ( ( I evalSub S ) ` R )   &    |- O = ( I eval S )   &    |- V = ( I mVar U )   &    |- U = ( S ↾s R )   &    |- B = ( Base ` S )   &    |- ( ph -> I e. A )   &    |- ( ph -> S e. CRing )   &    |- ( ph -> R e. (SubRing ` S ) )   &    |- ( ph -> X e. I )   =>    |- ( ph -> ( Q ` ( V ` X ) ) = ( O ` ( V ` X ) ) )
Theorem	evlvar 19529*	Simple polynomial evaluation maps variables to projections. (Contributed by AV, 12-Sep-2019.)
|- Q = ( I eval S )   &    |- V = ( I mVar S )   &    |- B = ( Base ` S )   &    |- ( ph -> I e. W )   &    |- ( ph -> S e. CRing )   &    |- ( ph -> X e. I )   =>    |- ( ph -> ( Q ` ( V ` X ) ) = ( g e. ( B ^m I ) |-> ( g ` X ) ) )
Theorem	mpfconst 19530	Constants are multivariate polynomial functions. (Contributed by Mario Carneiro, 19-Mar-2015.)
|- B = ( Base ` S )   &    |- Q = ran ( ( I evalSub S ) ` R )   &    |- ( ph -> I e. V )   &    |- ( ph -> S e. CRing )   &    |- ( ph -> R e. (SubRing ` S ) )   &    |- ( ph -> X e. R )   =>    |- ( ph -> ( ( B ^m I ) X. { X } ) e. Q )
Theorem	mpfproj 19531*	Projections are multivariate polynomial functions. (Contributed by Mario Carneiro, 20-Mar-2015.)
|- B = ( Base ` S )   &    |- Q = ran ( ( I evalSub S ) ` R )   &    |- ( ph -> I e. V )   &    |- ( ph -> S e. CRing )   &    |- ( ph -> R e. (SubRing ` S ) )   &    |- ( ph -> J e. I )   =>    |- ( ph -> ( f e. ( B ^m I ) |-> ( f ` J ) ) e. Q )
Theorem	mpfsubrg 19532	Polynomial functions are a subring. (Contributed by Mario Carneiro, 19-Mar-2015.) (Revised by Mario Carneiro, 6-May-2015.) (Revised by AV, 19-Sep-2021.)
|- Q = ran ( ( I evalSub S ) ` R )   =>    |- ( ( I e. V /\ S e. CRing /\ R e. (SubRing ` S ) ) -> Q e. (SubRing ` ( S ^s ( ( Base ` S ) ^m I ) ) ) )
Theorem	mpff 19533	Polynomial functions are functions. (Contributed by Mario Carneiro, 19-Mar-2015.)
|- Q = ran ( ( I evalSub S ) ` R )   &    |- B = ( Base ` S )   =>    |- ( F e. Q -> F : ( B ^m I ) --> B )
Theorem	mpfaddcl 19534	The sum of multivariate polynomial functions. (Contributed by Mario Carneiro, 19-Mar-2015.)
|- Q = ran ( ( I evalSub S ) ` R )   &    |- .+ = ( +g ` S )   =>    |- ( ( F e. Q /\ G e. Q ) -> ( F oF .+ G ) e. Q )
Theorem	mpfmulcl 19535	The product of multivariate polynomial functions. (Contributed by Mario Carneiro, 19-Mar-2015.)
|- Q = ran ( ( I evalSub S ) ` R )   &    |- .x. = ( .r ` S )   =>    |- ( ( F e. Q /\ G e. Q ) -> ( F oF .x. G ) e. Q )
Theorem	mpfind 19536*	Prove a property of polynomials by "structural" induction, under a simplified model of structure which loses the sum of products structure. (Contributed by Mario Carneiro, 19-Mar-2015.)
|- B = ( Base ` S )   &    |- .+ = ( +g ` S )   &    |- .x. = ( .r ` S )   &    |- Q = ran ( ( I evalSub S ) ` R )   &    |- ( ( ph /\ ( ( f e. Q /\ ta ) /\ ( g e. Q /\ et ) ) ) -> ze )   &    |- ( ( ph /\ ( ( f e. Q /\ ta ) /\ ( g e. Q /\ et ) ) ) -> si )   &    |- ( x = ( ( B ^m I ) X. { f } ) -> ( ps <-> ch ) )   &    |- ( x = ( g e. ( B ^m I ) |-> ( g ` f ) ) -> ( ps <-> th ) )   &    |- ( x = f -> ( ps <-> ta ) )   &    |- ( x = g -> ( ps <-> et ) )   &    |- ( x = ( f oF .+ g ) -> ( ps <-> ze ) )   &    |- ( x = ( f oF .x. g ) -> ( ps <-> si ) )   &    |- ( x = A -> ( ps <-> rh ) )   &    |- ( ( ph /\ f e. R ) -> ch )   &    |- ( ( ph /\ f e. I ) -> th )   &    |- ( ph -> A e. Q )   =>    |- ( ph -> rh )
10.10.3  Additional definitions for (multivariate) polynomials Remark: There are no theorems using these definitions yet!
Syntax	cmhp 19537	Multivariate polynomials.
class mHomP
Syntax	cpsd 19538	Power series partial derivative function.
class mPSDer
Syntax	cslv 19539	Select a subset of variables in a multivariate polynomial.
class selectVars
Syntax	cai 19540	Algebraically independent.
class AlgInd
Definition	df-mhp 19541*	Define the subspaces of order- n homogeneous polynomials. (Contributed by Mario Carneiro, 21-Mar-2015.)
|- mHomP = ( i e. _V , r e. _V |-> ( n e. NN0 |-> { f e. ( Base ` ( i mPoly r ) ) | ( f supp ( 0g ` r ) ) C_ { g e. { h e. ( NN0 ^m i ) | ( `' h " NN ) e. Fin } | sum_ j e. NN0 ( g ` j ) = n } } ) )
Definition	df-psd 19542*	Define the differentiation operation on multivariate polynomials. (Contributed by Mario Carneiro, 21-Mar-2015.)
|- mPSDer = ( i e. _V , r e. _V |-> ( x e. i |-> ( f e. ( Base ` ( i mPwSer r ) ) |-> ( k e. { h e. ( NN0 ^m i ) | ( `' h " NN ) e. Fin } |-> ( ( ( k ` x ) + 1 ) (.g ` r ) ( f ` ( k oF + ( y e. i |-> if ( y = x , 1 , 0 ) ) ) ) ) ) ) ) )
Definition	df-selv 19543*	Define the "variable selection" function. The function ( ( I selectVars R ) ` J ) maps elements of ( I mPoly R ) bijectively onto ( J mPoly ( ( I \ J ) mPoly R ) ) in the natural way, for example if I = { x , y } and J = { y } it would map 1 + x + y + x y e. ( { x , y } mPoly ZZ ) to ( 1 + x ) + ( 1 + x ) y e. ( { y } mPoly ( { x } mPoly ZZ ) ). This, for example, allows one to treat a multivariate polynomial as a univariate polynomial with coefficients in a polynomial ring with one less variable. (Contributed by Mario Carneiro, 21-Mar-2015.)
|- selectVars = ( i e. _V , r e. _V |-> ( j e. ~P i |-> ( f e. ( i mPoly r ) |-> [_ ( ( i \ j ) mPoly r ) / s ]_ [_ ( x e. (Scalar ` s ) |-> ( x ( .s ` s ) ( 1r ` s ) ) ) / c ]_ ( ( ( ( i evalSub s ) ` ( c "s r ) ) ` ( c o. f ) ) ` ( x e. i |-> if ( x e. j , ( ( j mVar ( ( i \ j ) mPoly r ) ) ` x ) , ( c o. ( ( ( i \ j ) mVar r ) ` x ) ) ) ) ) ) ) )
Definition	df-algind 19544*	Define the predicate "the set v is algebraically independent in the algebra w". A collection of vectors is algebraically independent if no nontrivial polynomial with elements from the subset evaluates to zero. (Contributed by Mario Carneiro, 21-Mar-2015.)
|- AlgInd = ( w e. _V , k e. ~P ( Base ` w ) |-> { v e. ~P ( Base ` w ) | Fun `' ( f e. ( Base ` ( v mPoly ( w ↾s k ) ) ) |-> ( ( ( ( v evalSub w ) ` k ) ` f ) ` ( _I |` v ) ) ) } )
10.10.4  Univariate polynomials According to Wikipedia ("Polynomial", 23-Dec-2019, https://en.wikipedia.org/wiki/Polynomial) "A polynomial in one indeterminate is called a univariate polynomial, a polynomial in more than one indeterminate is called a multivariate polynomial." In this sense univariate polynomials are defined as multivariate polynomials restricted to one indeterminate/polynomial variable in the following, see ply1bascl2 19574. According to the definition in Wikipedia "a polynomial can either be zero or can be written as the sum of a finite number of nonzero terms. Each term consists of the product of a number - called the coefficient of the term - and a finite number of indeterminates, raised to nonnegative integer powers.". By this, a term of a univariate polynomial (often also called "polynomial term") is the product of a coefficient (usually a member of the underlying ring) and the variable, raised to a nonnegative integer power. A (univariate) polynomial which has only one term is called (univariate) monomial - therefore, the notions "term" and "monomial" are often used synonymously, see also the definition in [Lang] p. 102. Sometimes, however, a monomial is defined as power product, "a product of powers of variables with nonnegative integer exponents", see Wikipedia ("Monomial", 23-Dec-2019, https://en.wikipedia.org/wiki/Mononomial). In [Lang] p. 101, such terms are called "primitive monomials". To avoid any ambiguity, the notion "primitive monomial" is used for such power products ("x^i") in the following, whereas the synonym for "term" ("ai x^i") will be "scaled monomial".
Syntax	cps1 19545	Univariate power series.
class PwSer1
Syntax	cv1 19546	The base variable of a univariate power series.
class var1
Syntax	cpl1 19547	Univariate polynomials.
class Poly1
Syntax	cco1 19548	Coefficient function for a univariate polynomial.
class coe1
Syntax	ctp1 19549	Convert a univariate polynomial representation to multivariate.
class toPoly1
Definition	df-psr1 19550	Define the algebra of univariate power series. (Contributed by Mario Carneiro, 29-Dec-2014.)
|- PwSer1 = ( r e. _V |-> ( ( 1o ordPwSer r ) ` (/) ) )
Definition	df-vr1 19551	Define the base element of a univariate power series (the X element of the set R [ X ] of polynomials and also the X in the set R [ [ X ] ] of power series). (Contributed by Mario Carneiro, 8-Feb-2015.)
|- var1 = ( r e. _V |-> ( ( 1o mVar r ) ` (/) ) )
Definition	df-ply1 19552	Define the algebra of univariate polynomials. (Contributed by Mario Carneiro, 9-Feb-2015.)
|- Poly1 = ( r e. _V |-> ( (PwSer1 ` r ) ↾s ( Base ` ( 1o mPoly r ) ) ) )
Definition	df-coe1 19553*	Define the coefficient function for a univariate polynomial. (Contributed by Stefan O'Rear, 21-Mar-2015.)
|- coe1 = ( f e. _V |-> ( n e. NN0 |-> ( f ` ( 1o X. { n } ) ) ) )
Definition	df-toply1 19554*	Define a function which maps a coefficient function for a univariate polynomial to the corresponding polynomial object. (Contributed by Mario Carneiro, 12-Jun-2015.)
|- toPoly1 = ( f e. _V |-> ( n e. ( NN0 ^m 1o ) |-> ( f ` ( n ` (/) ) ) ) )
Theorem	psr1baslem 19555	The set of finite bags on 1o is just the set of all functions from 1o to NN0. (Contributed by Mario Carneiro, 9-Feb-2015.)
|- ( NN0 ^m 1o ) = { f e. ( NN0 ^m 1o ) | ( `' f " NN ) e. Fin }
Theorem	psr1val 19556	Value of the ring of univariate power series. (Contributed by Mario Carneiro, 8-Feb-2015.)
|- S = (PwSer1 ` R )   =>    |- S = ( ( 1o ordPwSer R ) ` (/) )
Theorem	psr1crng 19557	The ring of univariate power series is a commutative ring. (Contributed by Mario Carneiro, 8-Feb-2015.)
|- S = (PwSer1 ` R )   =>    |- ( R e. CRing -> S e. CRing )
Theorem	psr1assa 19558	The ring of univariate power series is an associative algebra. (Contributed by Mario Carneiro, 8-Feb-2015.)
|- S = (PwSer1 ` R )   =>    |- ( R e. CRing -> S e. AssAlg )
Theorem	psr1tos 19559	The ordered power series structure is a totally ordered set. (Contributed by Mario Carneiro, 2-Jun-2015.)
|- S = (PwSer1 ` R )   =>    |- ( R e. Toset -> S e. Toset )
Theorem	psr1bas2 19560	The base set of the ring of univariate power series. (Contributed by Mario Carneiro, 3-Jul-2015.)
|- S = (PwSer1 ` R )   &    |- B = ( Base ` S )   &    |- O = ( 1o mPwSer R )   =>    |- B = ( Base ` O )
Theorem	psr1bas 19561	The base set of the ring of univariate power series. (Contributed by Mario Carneiro, 8-Feb-2015.)
|- S = (PwSer1 ` R )   &    |- B = ( Base ` S )   &    |- K = ( Base ` R )   =>    |- B = ( K ^m ( NN0 ^m 1o ) )
Theorem	vr1val 19562	The value of the generator of the power series algebra (the X in R [ [ X ] ]). Since all univariate polynomial rings over a fixed base ring R are isomorphic, we don't bother to pass this in as a parameter; internally we are actually using the empty set as this generator and 1o = { (/) } is the index set (but for most purposes this choice should not be visible anyway). (Contributed by Mario Carneiro, 8-Feb-2015.) (Revised by Mario Carneiro, 12-Jun-2015.)
|- X = (var1 ` R )   =>    |- X = ( ( 1o mVar R ) ` (/) )
Theorem	vr1cl2 19563	The variable X is a member of the power series algebra R [ [ X ] ]. (Contributed by Mario Carneiro, 8-Feb-2015.)
|- X = (var1 ` R )   &    |- S = (PwSer1 ` R )   &    |- B = ( Base ` S )   =>    |- ( R e. Ring -> X e. B )
Theorem	ply1val 19564	The value of the set of univariate polynomials. (Contributed by Mario Carneiro, 9-Feb-2015.)
|- P = (Poly1 ` R )   &    |- S = (PwSer1 ` R )   =>    |- P = ( S ↾s ( Base ` ( 1o mPoly R ) ) )
Theorem	ply1bas 19565	The value of the base set of univariate polynomials. (Contributed by Mario Carneiro, 9-Feb-2015.)
|- P = (Poly1 ` R )   &    |- S = (PwSer1 ` R )   &    |- U = ( Base ` P )   =>    |- U = ( Base ` ( 1o mPoly R ) )
Theorem	ply1lss 19566	Univariate polynomials form a linear subspace of the set of univariate power series. (Contributed by Mario Carneiro, 9-Feb-2015.)
|- P = (Poly1 ` R )   &    |- S = (PwSer1 ` R )   &    |- U = ( Base ` P )   =>    |- ( R e. Ring -> U e. ( LSubSp ` S ) )
Theorem	ply1subrg 19567	Univariate polynomials form a subring of the set of univariate power series. (Contributed by Mario Carneiro, 9-Feb-2015.)
|- P = (Poly1 ` R )   &    |- S = (PwSer1 ` R )   &    |- U = ( Base ` P )   =>    |- ( R e. Ring -> U e. (SubRing ` S ) )
Theorem	ply1crng 19568	The ring of univariate polynomials is a commutative ring. (Contributed by Mario Carneiro, 9-Feb-2015.)
|- P = (Poly1 ` R )   =>    |- ( R e. CRing -> P e. CRing )
Theorem	ply1assa 19569	The ring of univariate polynomials is an associative algebra. (Contributed by Mario Carneiro, 9-Feb-2015.)
|- P = (Poly1 ` R )   =>    |- ( R e. CRing -> P e. AssAlg )
Theorem	psr1bascl 19570	A univariate power series is a multivariate power series on one index. (Contributed by Stefan O'Rear, 25-Mar-2015.)
|- P = (PwSer1 ` R )   &    |- B = ( Base ` P )   =>    |- ( F e. B -> F e. ( Base ` ( 1o mPwSer R ) ) )
Theorem	psr1basf 19571	Univariate power series base set elements are functions. (Contributed by Stefan O'Rear, 25-Mar-2015.)
|- P = (PwSer1 ` R )   &    |- B = ( Base ` P )   &    |- K = ( Base ` R )   =>    |- ( F e. B -> F : ( NN0 ^m 1o ) --> K )
Theorem	ply1basf 19572	Univariate polynomial base set elements are functions. (Contributed by Stefan O'Rear, 21-Mar-2015.)
|- P = (Poly1 ` R )   &    |- B = ( Base ` P )   &    |- K = ( Base ` R )   =>    |- ( F e. B -> F : ( NN0 ^m 1o ) --> K )
Theorem	ply1bascl 19573	A univariate polynomial is a univariate power series. (Contributed by Stefan O'Rear, 25-Mar-2015.)
|- P = (Poly1 ` R )   &    |- B = ( Base ` P )   =>    |- ( F e. B -> F e. ( Base ` (PwSer1 ` R ) ) )
Theorem	ply1bascl2 19574	A univariate polynomial is a multivariate polynomial on one index. (Contributed by Stefan O'Rear, 25-Mar-2015.)
|- P = (Poly1 ` R )   &    |- B = ( Base ` P )   =>    |- ( F e. B -> F e. ( Base ` ( 1o mPoly R ) ) )
Theorem	coe1fval 19575*	Value of the univariate polynomial coefficient function. (Contributed by Stefan O'Rear, 21-Mar-2015.)
|- A = (coe1 ` F )   =>    |- ( F e. V -> A = ( n e. NN0 |-> ( F ` ( 1o X. { n } ) ) ) )
Theorem	coe1fv 19576	Value of an evaluated coefficient in a polynomial coefficient vector. (Contributed by Stefan O'Rear, 21-Mar-2015.)
|- A = (coe1 ` F )   =>    |- ( ( F e. V /\ N e. NN0 ) -> ( A ` N ) = ( F ` ( 1o X. { N } ) ) )
Theorem	fvcoe1 19577	Value of a multivariate coefficient in terms of the coefficient vector. (Contributed by Stefan O'Rear, 21-Mar-2015.)
|- A = (coe1 ` F )   =>    |- ( ( F e. V /\ X e. ( NN0 ^m 1o ) ) -> ( F ` X ) = ( A ` ( X ` (/) ) ) )
Theorem	coe1fval3 19578*	Univariate power series coefficient vectors expressed as a function composition. (Contributed by Stefan O'Rear, 25-Mar-2015.)
|- A = (coe1 ` F )   &    |- B = ( Base ` P )   &    |- P = (PwSer1 ` R )   &    |- G = ( y e. NN0 |-> ( 1o X. { y } ) )   =>    |- ( F e. B -> A = ( F o. G ) )
Theorem	coe1f2 19579	Functionality of univariate power series coefficient vectors. (Contributed by Stefan O'Rear, 25-Mar-2015.)
|- A = (coe1 ` F )   &    |- B = ( Base ` P )   &    |- P = (PwSer1 ` R )   &    |- K = ( Base ` R )   =>    |- ( F e. B -> A : NN0 --> K )
Theorem	coe1fval2 19580*	Univariate polynomial coefficient vectors expressed as a function composition. (Contributed by Stefan O'Rear, 21-Mar-2015.)
|- A = (coe1 ` F )   &    |- B = ( Base ` P )   &    |- P = (Poly1 ` R )   &    |- G = ( y e. NN0 |-> ( 1o X. { y } ) )   =>    |- ( F e. B -> A = ( F o. G ) )
Theorem	coe1f 19581	Functionality of univariate polynomial coefficient vectors. (Contributed by Stefan O'Rear, 21-Mar-2015.)
|- A = (coe1 ` F )   &    |- B = ( Base ` P )   &    |- P = (Poly1 ` R )   &    |- K = ( Base ` R )   =>    |- ( F e. B -> A : NN0 --> K )
Theorem	coe1fvalcl 19582	A coefficient of a univariate polynomial over a class/ring is an element of this class/ring. (Contributed by AV, 9-Oct-2019.)
|- A = (coe1 ` F )   &    |- B = ( Base ` P )   &    |- P = (Poly1 ` R )   &    |- K = ( Base ` R )   =>    |- ( ( F e. B /\ N e. NN0 ) -> ( A ` N ) e. K )
Theorem	coe1sfi 19583	Finite support of univariate polynomial coefficient vectors. (Contributed by Stefan O'Rear, 21-Mar-2015.) (Revised by AV, 19-Jul-2019.)
|- A = (coe1 ` F )   &    |- B = ( Base ` P )   &    |- P = (Poly1 ` R )   &    |- .0. = ( 0g ` R )   =>    |- ( F e. B -> A finSupp .0. )
Theorem	coe1fsupp 19584*	The coefficient vector of a univariate polynomial is a finitely supported mapping from the nonnegative integers to the elements of the coefficient class/ring for the polynomial. (Contributed by AV, 3-Oct-2019.)
|- A = (coe1 ` F )   &    |- B = ( Base ` P )   &    |- P = (Poly1 ` R )   &    |- .0. = ( 0g ` R )   &    |- K = ( Base ` R )   =>    |- ( F e. B -> A e. { g e. ( K ^m NN0 ) | g finSupp .0. } )
Theorem	mptcoe1fsupp 19585*	A mapping involving coefficients of polynomials is finitely supported. (Contributed by AV, 12-Oct-2019.)
|- P = (Poly1 ` R )   &    |- B = ( Base ` P )   &    |- .0. = ( 0g ` R )   =>    |- ( ( R e. Ring /\ M e. B ) -> ( k e. NN0 |-> ( (coe1 ` M ) ` k ) ) finSupp .0. )
Theorem	coe1ae0 19586*	The coefficient vector of a univariate polynomial is 0 almost everywhere. (Contributed by AV, 19-Oct-2019.)
|- A = (coe1 ` F )   &    |- B = ( Base ` P )   &    |- P = (Poly1 ` R )   &    |- .0. = ( 0g ` R )   =>    |- ( F e. B -> E. s e. NN0 A. n e. NN0 ( s < n -> ( A ` n ) = .0. ) )
Theorem	vr1cl 19587	The generator of a univariate polynomial algebra is contained in the base set. (Contributed by Stefan O'Rear, 19-Mar-2015.)
|- X = (var1 ` R )   &    |- P = (Poly1 ` R )   &    |- B = ( Base ` P )   =>    |- ( R e. Ring -> X e. B )
Theorem	opsr0 19588	Zero in the ordered power series ring. (Contributed by Stefan O'Rear, 23-Mar-2015.) (Revised by Mario Carneiro, 2-Oct-2015.)
|- S = ( I mPwSer R )   &    |- O = ( ( I ordPwSer R ) ` T )   &    |- ( ph -> T C_ ( I X. I ) )   =>    |- ( ph -> ( 0g ` S ) = ( 0g ` O ) )
Theorem	opsr1 19589	One in the ordered power series ring. (Contributed by Stefan O'Rear, 23-Mar-2015.) (Revised by Mario Carneiro, 2-Oct-2015.)
|- S = ( I mPwSer R )   &    |- O = ( ( I ordPwSer R ) ` T )   &    |- ( ph -> T C_ ( I X. I ) )   =>    |- ( ph -> ( 1r ` S ) = ( 1r ` O ) )
Theorem	mplplusg 19590	Value of addition in a polynomial ring. (Contributed by Stefan O'Rear, 21-Mar-2015.) (Revised by Mario Carneiro, 2-Oct-2015.)
|- Y = ( I mPoly R )   &    |- S = ( I mPwSer R )   &    |- .+ = ( +g ` Y )   =>    |- .+ = ( +g ` S )
Theorem	mplmulr 19591	Value of multiplication in a polynomial ring. (Contributed by Stefan O'Rear, 21-Mar-2015.) (Revised by Mario Carneiro, 2-Oct-2015.)
|- Y = ( I mPoly R )   &    |- S = ( I mPwSer R )   &    |- .x. = ( .r ` Y )   =>    |- .x. = ( .r ` S )
Theorem	psr1plusg 19592	Value of addition in a univariate power series ring. (Contributed by Stefan O'Rear, 21-Mar-2015.) (Revised by Mario Carneiro, 2-Oct-2015.)
|- Y = (PwSer1 ` R )   &    |- S = ( 1o mPwSer R )   &    |- .+ = ( +g ` Y )   =>    |- .+ = ( +g ` S )
Theorem	psr1vsca 19593	Value of scalar multiplication in a univariate power series ring. (Contributed by Stefan O'Rear, 21-Mar-2015.) (Revised by Mario Carneiro, 2-Oct-2015.)
|- Y = (PwSer1 ` R )   &    |- S = ( 1o mPwSer R )   &    |- .x. = ( .s ` Y )   =>    |- .x. = ( .s ` S )
Theorem	psr1mulr 19594	Value of multiplication in a univariate power series ring. (Contributed by Stefan O'Rear, 21-Mar-2015.) (Revised by Mario Carneiro, 2-Oct-2015.)
|- Y = (PwSer1 ` R )   &    |- S = ( 1o mPwSer R )   &    |- .x. = ( .r ` Y )   =>    |- .x. = ( .r ` S )
Theorem	ply1plusg 19595	Value of addition in a univariate polynomial ring. (Contributed by Stefan O'Rear, 21-Mar-2015.) (Revised by Mario Carneiro, 4-Jul-2015.)
|- Y = (Poly1 ` R )   &    |- S = ( 1o mPoly R )   &    |- .+ = ( +g ` Y )   =>    |- .+ = ( +g ` S )
Theorem	ply1vsca 19596	Value of scalar multiplication in a univariate polynomial ring. (Contributed by Stefan O'Rear, 21-Mar-2015.) (Revised by Mario Carneiro, 4-Jul-2015.)
|- Y = (Poly1 ` R )   &    |- S = ( 1o mPoly R )   &    |- .x. = ( .s ` Y )   =>    |- .x. = ( .s ` S )
Theorem	ply1mulr 19597	Value of multiplication in a univariate polynomial ring. (Contributed by Stefan O'Rear, 21-Mar-2015.) (Revised by Mario Carneiro, 4-Jul-2015.)
|- Y = (Poly1 ` R )   &    |- S = ( 1o mPoly R )   &    |- .x. = ( .r ` Y )   =>    |- .x. = ( .r ` S )
Theorem	ressply1bas2 19598	The base set of a restricted polynomial algebra consists of power series in the subring which are also polynomials (in the parent ring). (Contributed by Mario Carneiro, 3-Jul-2015.)
|- S = (Poly1 ` R )   &    |- H = ( R ↾s T )   &    |- U = (Poly1 ` H )   &    |- B = ( Base ` U )   &    |- ( ph -> T e. (SubRing ` R ) )   &    |- W = (PwSer1 ` H )   &    |- C = ( Base ` W )   &    |- K = ( Base ` S )   =>    |- ( ph -> B = ( C i^i K ) )
Theorem	ressply1bas 19599	A restricted polynomial algebra has the same base set. (Contributed by Mario Carneiro, 3-Jul-2015.)
|- S = (Poly1 ` R )   &    |- H = ( R ↾s T )   &    |- U = (Poly1 ` H )   &    |- B = ( Base ` U )   &    |- ( ph -> T e. (SubRing ` R ) )   &    |- P = ( S ↾s B )   =>    |- ( ph -> B = ( Base ` P ) )
Theorem	ressply1add 19600	A restricted polynomial algebra has the same addition operation. (Contributed by Mario Carneiro, 3-Jul-2015.)
|- S = (Poly1 ` R )   &    |- H = ( R ↾s T )   &    |- U = (Poly1 ` H )   &    |- B = ( Base ` U )   &    |- ( ph -> T e. (SubRing ` R ) )   &    |- P = ( S ↾s B )   =>    |- ( ( ph /\ ( X e. B /\ Y e. B ) ) -> ( X ( +g ` U ) Y ) = ( X ( +g ` P ) Y ) )