Normal forms of polynomials over a semiring

Click For Summary
SUMMARY

This discussion focuses on the normal forms of polynomials over a commutative semiring, defined as a triple (R,+,.) where (R,+) is a commutative monoid and (R,.) is a commutative semigroup. It establishes that two polynomials, p and q, are equal if and only if their coefficients are identical, under the condition that all operations are confined to the semiring. The discussion highlights the lack of additive cancellations in general, emphasizing the necessity for further assumptions on R to ensure that polynomial equality can be determined through evaluation homomorphisms.

PREREQUISITES
  • Understanding of commutative semirings
  • Familiarity with polynomial algebra
  • Knowledge of n-variate indeterminates
  • Concept of homomorphisms in algebra
NEXT STEPS
  • Explore the properties of commutative semirings in depth
  • Study polynomial equality in various algebraic structures
  • Investigate the implications of additive cancellation in semirings
  • Learn about injective homomorphisms and their role in polynomial evaluation
USEFUL FOR

Mathematicians, algebraists, and students studying abstract algebra, particularly those interested in polynomial structures and semiring theory.

icantadd
Messages
109
Reaction score
0
Let R be a commutative semiring. That is a triple (R,+,.) such that (R,+) is a commutative monoid and (R,.) is a commutative semigroup. Let [tex]{\mathbf \alpha}_i = \alpha_1,\alpha_2,\ldots,\alpha_n[/tex]. The n-variate indeterminate is just free monoid on n letters. However, it is common to introduce notation for indeterminates that makes them easier to work with. This notation is that we write every element in the form [tex]x_1^{\alpha_1}\cdots x_n^{\alpha_n} = {\mathbf x}^{{\mathbf \alpha}}[/tex], and [tex]x_i^0 = 1[/tex], so that the string in the free monoid on 4 letters (for example), [tex]x_2x_3[/tex] is written as [tex]x_1^0x_2^1x_3^1x_4^0[/tex] or in the compact form [tex]{\mathbf x}^{0,1,1,0}[/tex]Define [tex]R[x_1,\ldots,x_n][/tex] to be the polynomial semiring in variables over R where
[tex]R[x_1,\ldots,x_n] = \left\{ \sum_i r_i {\mathbf x}^{{\mathbf \alpha}_i} | r_i \in R , {\mathbf x}^{\mathbf \alpha}_i \text{ is an n-variate indeterminate} \right \}[/tex] with the where
[tex](\sum_i r_i {\mathbf x}^{\mathbf \alpha}_i) + (\sum_i s_i {\mathbf x}^{{\mathbf \alpha}_i}) = \sum_i (r_i+s_i){\mathbf x}^{{\mathbf \alpha}_i}[/tex]
[tex]((\sum_i r_i {\mathbf x}^{{\mathbf \alpha}_i}) )( (\sum_i s_i {\mathbf x}^{{\mathbf \alpha}_i})) = \sum_k (\sum_I[i=0}^kr_i s_i){\mathbf x}^{{\mathbf \alpha}_k} [/tex]<br /> Nothing other than sums and products defined under the above operations are in [tex]R[x_1,\ldots,x_n][/tex]<br /> <br /> Now, it seems reasonable to assert that two polynomials [tex]p = \sum_i r_i {\mathbf x}^{{\mathbf \alpha}_i}[/tex] and [tex]q = \sum_i s_i {\mathbf x}^{{\mathbf \alpha}_i}[/tex] are equal iff [tex]r_i = s_i[/tex] for each i. It is also reasonable to assert that polynomials in semiring are equal when viewed as functions of [tex]R^n[/tex] to R. However, we require that all products and sums are in the semiring. So if we want the two reasonable notions of polynomial equality to coincide we must be able to assert that normal form is well defined, that is, if p and q (as above) are normal forms for a polynomial, f, then [tex]r_i = s_i[/tex] for each i.<br /> But we do not have additive cancellations in general, so suppose suppose that p and q are two normal forms for some polynomial f. Then, we can certainly show that [tex]r_0 = s_0[/tex]. But withouth the property that if [tex]a+b=a+c \Rightarrow b=c[/tex] How would one show the other coefficients are equal?[/tex]
 
Last edited:
Physics news on Phys.org
This is a rather specific situation. Generally a polynomial equals another if and only if all coefficients are the same. This has nothing to do with inserting values. Inserting values is usually a ring homomorphism, will say I don't know what your restrictions to a semiring will damage, and should be regarded as such. And generally you cannot conclude that pre-images are identical if their images are. You have to show that the insertion or evaluation homomorphism is injective. I don't think this is possible without further assumptions on ##R##.
 

Similar threads

  • · Replies 25 ·
Replies
25
Views
4K
  • · Replies 40 ·
2
Replies
40
Views
5K
Replies
3
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 52 ·
2
Replies
52
Views
4K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 17 ·
Replies
17
Views
3K
  • · Replies 28 ·
Replies
28
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 14 ·
Replies
14
Views
3K