Editing
Abstract Algebra
(section)
Jump to navigation
Jump to search
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
== <span style="color: #FFFFFF;">Understanding</span> == Abstract algebra's power comes from identifying the right level of abstraction for a given problem. Three fundamental structures dominate: '''Groups and symmetry''': Groups are the mathematical language of symmetry. The symmetries of a square form a group of order 8 (the dihedral group Dβ). The symmetries of the hydrogen atom's Hamiltonian form a continuous group (SO(3)), which is why its energy levels have the degeneracy they do. Emmy Noether proved that every continuous symmetry of a physical system corresponds to a conserved quantity β one of the deepest results connecting abstract algebra to physics. Finite group theory culminated in the Classification of Finite Simple Groups β a 10,000-page collective proof completed in 2004. '''Rings, ideals, and polynomial equations''': Rings generalize the integers. The integers β€ are a ring; so are polynomial rings β€[x], and quotient rings β€/nβ€ (integers mod n). Ideals play the role that normal subgroups play for groups: they allow the construction of quotient rings. The integers mod a prime p form a field (π½_p) β a crucial structure in number theory and cryptography. Polynomial rings R[x] allow us to study root-finding algebraically; the structure of roots and their field extensions is governed by Galois theory. '''Galois theory and unsolvability''': A polynomial equation is solvable by radicals if its roots can be expressed using +, β, Γ, Γ·, and nth roots of its coefficients. Galois (age 20) proved that the quintic equation (degree 5) is NOT generally solvable by radicals β by studying the symmetry group of the polynomial's roots. The key result: a polynomial is solvable by radicals iff its Galois group is a solvable group. This unified and resolved centuries of algebraic frustration. '''Finite fields and their applications''': Fields with finitely many elements (π½_{p^n}, p prime) are fundamental to coding theory, cryptography, and combinatorics. Reed-Solomon codes (used on CDs, DVDs, QR codes, and spacecraft) are defined over finite fields. Elliptic curves over finite fields are the basis of modern public-key cryptography (ECC). The Galois field GF(2βΈ) is the foundation of the AES encryption standard. </div> <div style="background-color: #8B0000; color: #FFFFFF; padding: 20px; border-radius: 8px; margin-bottom: 15px;">
Summary:
Please note that all contributions to BloomWiki may be edited, altered, or removed by other contributors. If you do not want your writing to be edited mercilessly, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource (see
BloomWiki:Copyrights
for details).
Do not submit copyrighted work without permission!
Cancel
Editing help
(opens in new window)
Navigation menu
Personal tools
Not logged in
Talk
Contributions
Create account
Log in
Namespaces
Page
Discussion
English
Views
Read
Edit
View history
More
Search
Navigation
Main page
Recent changes
Random page
Help about MediaWiki
Tools
What links here
Related changes
Special pages
Page information