4 ms·
> At any rate we have to impose that n·0=0, which can't be writen cleverly as "repeated addition" and worked up backwards. n * 0 = n * (1 + (-1)) = n + (-n)
by dragontamer 6y ago
> At any rate we have to impose that n·0=0, which can't be writen cleverly as "repeated addition" and worked up backwards.
n * 0 = n * (1 + (-1)) = n + (-n) = 0.
-----
The 0-element in a Galois Field works identically btw. In GF(5), the 0 element is 5 (5 mod 5 == 0).
n * (5) == n * 0 == n * (1 + (-1)) == n * (1 + 4) == 0 mod5.
For example, if we take "n" == 2, 2 * 5 == 10 mod 5 == 0.
2 * (1 + 4) == 2 + 8 == 2 + 3 (mod 5) == 5 mod 5 == 0. Etc. etc.
-------
This property literally holds in all fields and rings (but not groups).
- mnl 6y agoRepeated addition that ain't... It boggles my mind that you've been studying Galois theory yet somehow try to reduce the algebraic structures associated to two binary operations to playing with one of them.
- dragontamer 6y agoThe algebraic structures multiplication brings is different from the algebraic structures from addition. That's the point of rings (as opposed to groups). Nonetheless, in a ring (and all fields are rings), multiplication must and always is related to addition, through the distributed property (which I argue, the distributed property IS the mathematical term for "repeated addition"). Without the distributed property, you have no ring. You at best only have a group. Therefore, all multiplication operators ever defined (or more precisely, all rings) must have multiplication related to addition: (A * (B+C) == AB+AC)
- mnl 6y agoWithout the distributive property you have two magmas in general for the same set that don't see each other. I'm not sure what your point is. When you have two binary operations you need some sort of distributive property to build a structure. All this is trivial, if you consider a ring, you get a·0=0 as a property, if your starting point is the Peano axioms for the arithmetic of natural numbers that's one of them, for the latter seeing it as "repeated addition" makes no sense, for the former, well you have a ring, you have two binary operations, not one, and of course you have some form of distributive property or else you'd be studying this set with just one binary operation at a time. I'd like to see how "repeated addition" works in polynomial rings.
- dragontamer 6y ago> I'd like to see how "repeated addition" works in polynomial rings. Consider the following polynomial: x0 * b^0 + x1 * b^1 + x2 * b^2 ... xn * b^n, where "n" goes to both positive infinity and negative infinity. When "b = 10" and when "x" can be numbers from [0-9], we have the so called base-10 set of real numbers, do we not? IIRC, if b = sqrt(-1) * 10, we then have the set of complex numbers (a non-intuitive result. I may have made a mistake somewhere, but I assure you there's a surprising property along those lines). That's the funny thing about real numbers and complex-numbers. Real numbers and even complex-numbers ARE polynomials, and therefore a polynomial ring. 3.1415926 == 3 * 10^0 + 1 * 10 ^-1 + 4 * 10 ^-2 ... ------------ I'm using a lot of words here. But all I'm saying is once again: Pi * 3 == 3.14... * 3 == 3 * 3 + 0.1 * 3 + 0.04 * 3 + ... == 9.42... We can evaluate 3 * Pi by splitting Pi up into a set of additions (3 + 0.1 + 0.04 + 0.001...), even if that set of additions is infinite. Then evaluate 3*(each component). This is possible because Pi is easily represented as a polynomial X0 * 10^0 + X1 * 10^-1 + ... Xn * 10^-n. There's a reason why polynomial multiplication is usually called "Carry-free multiplication". Because Real-numbers are just polynomials where you have that annoying "carry the one" property to keep track of. Remove the "carry the one" property (in say: Galois extension fields), and all the math still works. -------- Hmmmm... I probably could have said all that in fewer words. TL;DR: "Real numbers ARE a polynomial ring". (And complex numbers are probably a polynomial ring, I just forgot how to prove that factoid) > I'd like to see how "repeated addition" works in polynomial rings. EDIT: Just thought of a cute and simple retort. You ever do a CRC32 check? There ya go.
- mnl 6y agoA polynomial is a polynomial, a decimal representation of a real number is a decimal representation of a real number, and your representation of complex numbers has funny properties once you begin exponentiating that. I'd like to see how you'd show kids that: (1+x+x^2)·(1-x^3) is a "repeated addition", both belong to the ring Z[x].
- dragontamer 6y ago> I'd like to see how you'd show kids that: (1+x+x^2)·(1-x^3) is a "repeated addition", both belong to the ring Z[x]. Is that not just (1 * (1-x^3) + x * (1-x^3) + x^2 * (1-x^3)) ?? The polynomial itself gives us the means at which we logically split up the multiplication into component parts. Just as 3.14 * 3 == 3 * 3 + 0.1 * 3 + 0.04 * 3, when we move onto polynomials, we do the same exact thing. EDIT: remember, ALL REAL NUMBERS ARE POLYNOMIALS with a base of 10. Or to put it another way: when x == 10, your polynomial of (1 + x + x^2) * (1-x^3) == 111 * (-999). That is to say: real numbers are simply polynomials where "x" has been defined to be a particular number, instead of an abstract entity. We call that number the radix-base. If you instead defined the base to be x = 16 (hexadecimal numbers), you'd get 111 * (-FFF), which you'll find will satisfy similar properties. Now leave x-undefined (since it could be 10 or 16), and what do you get? Polynomial math. Or so called "Carry-less multiplication" (https://en.wikipedia.org/wiki/Carry-less_product https://en.wikipedia.org/wiki/Carry-less_product). We don't have a ring yet though: we still need to perform a modulus on all those polynomials to return to a proper ring (and if the modulus is irreducable, we have a Galois field). But we can already see how polynomials and the Reals are so closely related.
- thaumasiotes 6y ago> n * 0 = n * (1 + (-1)) = n + (-n) = 0 You don't think it's easier to say "n·5 = n·(5+0) = n·5 + n·0"?
- dragontamer 6y agoThe (1 + (-1)) thing was very precisely written. All rings have 0 and 1 as elements. 0 is the additive identity. 1 is the multiplicative identity. 0 and 1 are NOT necessarily numbers. In Linear Algebra of 2x2 matricies, 0 is: [ 0 0 0 0 ] And 1 is: [ 1 0 0 1 ] Because A * 1 == A, A * 0 == [0 0; 0 0]... etc. etc. In general, you cannot really assume much more than "0 exists" and "1 exists" when working with Rings (at least, if you want your proof to extend out to all possible ring algebras). 0 and 1 may look like something you wildly don't expect... they're abstract labels that are kind of undefined aside from being additive-identity or multiplicative-identity, respectively. -------------- As such, the concept of "5" does not necessarily exist in all possible Ring-systems. "5" exists in GF(5) for example, but not really in GF(3). Case in point, what does "5" mean in 2x2 Matrix Linear Algebra over GF(2)? -------- "-A" is called the additive inverse of A, which also exists in all rings. A - A = 0. In GF(5), -1 is 4 for example. In 2x2 Linear Algebra, -1 is [-1 0; 0 -1]. In Real Numbers, -1 is... well... -1. ---------- Anyway, the A * 0 == A * (1 + (-1)) == A - A == 0 thing is built up from fundamental portions of Ring theory. As such, the proof I constructed at first applies to all rings. (And then later, I did an example in the GF(5) system as a specific example).
- thaumasiotes 6y ago> As such, the concept of "5" does not necessarily exist in all possible Ring-systems. Don't think of 5 as a quantity; think of it as a variable name. The proof only depends on the concept of addition and an additive identity (and distribution of multiplication over addition, which you're using anyway); no property of 5 appeared. > the A * 0 == A * (1 + (-1)) == A - A == 0 thing is built up from fundamental portions of Ring theory. As such, the proof I constructed at first applies to all rings. To repeat myself: n·5 = n·(5+0) [definition of 0] n·(5+0) = n·5 + n·0 [multiplication is distributive over addition] n·0 = 0 [definition of 0] Every step in that proof is a direct application of one of the ring axioms; it doesn't matter what 5 is.