How Did Abstract Algebra Evolve From Elementary Algebra?

  • Thread starter Thread starter Avichal
  • Start date Start date
  • Tags Tags
    Algebra History
Avichal
Messages
294
Reaction score
0
In math, we normally proceed by learning elementary arithmetic and then elementary algebra. For me algebra is all about assigning a symbol to an unknown value and manipulating it to find its value.
Now I don't understand how concepts like groups, fields, rings etc. fall into the algebra category.

Wikipedia tells about the history of abstract algebra in brief:
Attempts to find formulae for solutions of general polynomial equations of higher degree that resulted in discovery of groups as abstract manifestations of symmetry.

Arithmetical investigations of quadratic and higher degree forms and diophantine equations, that directly produced the notions of a ring and ideal.

I've not studied general polynomial equations and higher degree forms of diophantine equations so I don't understand this.

Can someone please explain me how concepts like groups, fields, rings etc. fit into my understanding of algebra which is basically assigning symbols to unknown and playing with it.
 
Last edited:
Physics news on Phys.org
Without giving you a full course in college algebra, algebra is a little more involved than "assigning a symbol to an unknown value and manipulating it to find its value."

Why should you be able to do this at all?

Algebra shows us that if we, for instance, take a real number and multiply it by another real number, we should get a real number result. Or, that the order in which we multiply two real numbers together is immaterial to getting the product, e.g. A × B = B × A. But what if the order in which two numbers were multiplied together made a difference in the value of the product obtained, so that A × B ≠ B × A? Abstract algebra helps to generalize the ramifications on other aspects of arithmetic what happens in such situations.

Algebra studies the solutions to polynomial equations with real number coefficients and positive integer powers. You should know how to solve for the unknown value in a simple linear equation, and you should have learned the quadratic formula for solving second degree equations. There are complicated formulas for solving cubic and fourth order equations, but no such formulas have ever been found which solve fifth and higher order equations. Why is that?

Well, a very young Frenchman named Galois pondered this question and showed that it was impossible for a formula involving a finite number of arithmetical operations to be developed to solve fifth order equations and higher degree equations. He did this by showing that the different solutions to a given type of equation could be organized into what is known as a group, and that only certain types of equations had solutions which fell into what are now called "solvable groups".

Don't worry if you don't understand this. Some of the best mathematical minds of Galois' generation and later had much difficulty grasping what Galois had done, primarily because Galois was working with math concepts which were so unfamiliar at the time.

http://en.wikipedia.org/wiki/Évariste_Galois

http://en.wikipedia.org/wiki/Galois_theory
 
  • Like
Likes Jaeusm
I asked online questions about Proposition 2.1.1: The answer I got is the following: I have some questions about the answer I got. When the person answering says: ##1.## Is the map ##\mathfrak{q}\mapsto \mathfrak{q} A _\mathfrak{p}## from ##A\setminus \mathfrak{p}\to A_\mathfrak{p}##? But I don't understand what the author meant for the rest of the sentence in mathematical notation: ##2.## In the next statement where the author says: How is ##A\to...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...

Similar threads

Back
Top