Algebra: Difference between revisions
→History: added image of euclid |
Salix alba (talk | contribs) →Algebraic structures: big rewrite, assuming the reader is familiar with simple arithmetic and nothing else |
||
Line 31: | Line 31: | ||
* It allows the reference to "unknown" numbers, the formulation of [[equation]]s and the study of how to solve these (for instance "find a number ''x'' such that <math>3x + 1 = 10</math>). |
* It allows the reference to "unknown" numbers, the formulation of [[equation]]s and the study of how to solve these (for instance "find a number ''x'' such that <math>3x + 1 = 10</math>). |
||
* It allows the formulation of [[function (mathematics)|function]]al relationships (such as "if you sell ''x'' tickets, then your profit will be <math>3x - 10</math> dollars"). |
* It allows the formulation of [[function (mathematics)|function]]al relationships (such as "if you sell ''x'' tickets, then your profit will be <math>3x - 10</math> dollars"). |
||
==Abstract algebra== |
|||
:''Main article: [[Abstract algebra]]; see also [[algebraic structures]]''. |
|||
'''Abstract algebra''' extends the familiar concepts found in elementary algebra and [[arithmetic]] of [[numbers]] to more general concepts. |
|||
'''[[Set]]s''': Rather than just considering the different types of [[number]]s, abstract algebra deals with the more general concept of ''sets'': a collection of objects called [[elements]]. All the familiar types of numbers are sets. More general sets include the set of all two by two [[Matrix (mathematics)|matrices]], the set of all second degree [[polynomials]] (''ax''<sup>2</sup>+''bx''+''c''), the set of all two dimensional [[vectors]] in the plane, and the various [[finite groups]] such as the [[cyclic group]]s which are the group of integers module ''n''. [[Set theory]] is a branch of [[logic]] and not technically a branch of algebra. |
|||
'''[[Binary operation]]s''': The notion of [[addition]] (+) is abstracted to give a ''binary operation'', * say. For two elements ''a'' and ''b'' in a set ''S'' ''a''*''b'' gives another element in the set, (technically this condition is called [[Closure (mathematics)|closure]]). [[Addition]] (+), [[subtraction]] (-), [[multiplication]] (×), and [[division]] (÷) are all binary operations as in addition and multiplication of matrices, vectors, and polynomials. |
|||
'''[[Identity element]]s''': Zero and one are abstracted to give the notion of an ''identity element''. Zero is the identity element for addition and one is the identity element for multiplication. For a general binary operator * the identity element ''e'' must satisfy ''a''*''e''=''a'' and ''e''*''a''=''a''. This holds for addition as ''a''+0=''a'', and 0+''a''=''a'' and multiplication ''a''×''1''=''a'', 1×''a''=''a''. However, if we take the positive natural numbers and addition, there is no identity element. |
|||
'''[[Inverse elements]]''': The negative numbers gives rise to the concept of an ''inverse elements''. For addition the inverse of ''a'' is ''-a'', and for multiplication the inverse is <sup>1</sup>/<sub>''a''</sub>. A general inverse element ''a''<sup>-1</sup> must satisfy the property that ''a''*''a''<sup>-1</sup>=''e'' and ''a''<sup>-1</sup>*''a''=''e''. |
|||
'''[[Associativity]]''': The integers with addition have a property called associativity: (2+3)+4=2+(3+4). In general this becomes (''a''+''b'')+''c''=''a''+(''b''+''c''). This property is shared by most binary operations, but not subtraction or division. |
|||
'''[[Commutative operation|Commutativity]]''': The integers with addition also have a property called commutativity: 2+3=3+2. In general this becomes ''a''+''b''=''b''+''a''. Only some binary operations have this property, it holds for the integers with addition and multiplication, but it does not hold for [[matrix multiplication]]. |
|||
===Groups=== |
|||
:''Main article: [[group (mathematics)|group]]; see also [[group theory]], [[examples of groups]]'' |
|||
Combining the above concepts gives one of the most important structures in mathematics: a '''[[group (mathematics)|group]]'''. A group consists of: |
|||
*a set ''S'' of elements, |
|||
*a(closed) binary operation (*) |
|||
*an identity element exists, |
|||
*every element has an inverse, |
|||
*the operation is associative. |
|||
If commutativity is include as well then we obtain an [[Abelian group]]. |
|||
For example, the set of integers under the operation of addition is a group. In this group, the identity element is 0 and the inverse of any element ''a'' is its negation, -''a''. The associativity requirement is met since for any integers ''a'', ''b'' and ''c'', <math>(a+b)+c = a+(b+c)</math>. |
|||
The non-zero [[rational number]]s form a group under multiplication. Here, the identity element is 1, since <math>1 \cdot a = a \cdot 1 = a</math> for any any rational number ''a''. The inverse of ''a'' is <math>\frac{1}{a}</math>, since <math>a \cdot {1 \over a}=1</math>. |
|||
The integers under the multiplication operation, however, do not form a group. This is because, in general, the multiplicative inverse of an integer is not an integer. For example, 4 is an integer, but its multiplicative inverse is <sup>1</sup>/<sub>4</sub>, which is not an integer. |
|||
The theory of groups is studied in [[group theory]]. A major result in this theory is the [[Classification of finite simple groups]] a vast body of work which classified all the is a vast body of work, mostly published between around [[1955]] and [[1983]], which is thought to classify all of the [[finite set|finite]] [[simple group]]s. |
|||
{|class="wikitable" |
|||
|- |
|||
|colspan=11|Examples of groups |
|||
|- |
|||
!Set: |
|||
|colspan=2|[[Natural numbers]] <math>\mathbb{N}</math> |
|||
|colspan=2|[[Integers]] <math>\mathbb{Z}</math> |
|||
|colspan=4|[[Rational numbers]] <math>\mathbb{Q}</math> (also [[Real numbers|real]] <math>\mathbb{R}</math> and [[Complex numbers|complex]] <math>\mathbb{C}</math> numbers) |
|||
|Integers mod 3: {0,1,2} |
|||
|- |
|||
!operation |
|||
| + (including zero) |
|||
| × (excluding zero) |
|||
| + |
|||
| × (excluding zero) |
|||
| + |
|||
| − |
|||
| × (excluding zero) |
|||
| ÷ (excluding zero) |
|||
| + |
|||
|- |
|||
!Closed |
|||
|Yes |
|||
|Yes |
|||
|Yes |
|||
|Yes |
|||
|Yes |
|||
|Yes |
|||
|Yes |
|||
|Yes |
|||
|Yes |
|||
|- |
|||
|identity |
|||
|0 |
|||
|1 |
|||
|0 |
|||
|1 |
|||
|0 |
|||
|NA |
|||
|1 |
|||
|NA |
|||
|0 |
|||
|- |
|||
|inverse |
|||
|NA |
|||
|NA |
|||
| -1 |
|||
|NA |
|||
| -1 |
|||
|NA |
|||
|<sup>1</sup>/<sub>''a''</sub> |
|||
|NA |
|||
|0,2,1 receptively |
|||
|- |
|||
|Associative |
|||
|Yes |
|||
|Yes |
|||
|Yes |
|||
|Yes |
|||
|Yes |
|||
|No |
|||
|Yes |
|||
|No |
|||
|Yes |
|||
|- |
|||
|Commutative |
|||
|Yes |
|||
|Yes |
|||
|Yes |
|||
|Yes |
|||
|Yes |
|||
|No |
|||
|Yes |
|||
|No |
|||
|Yes |
|||
|- |
|||
|Structure |
|||
|[[Magma (algebra)|semigroup]] |
|||
|[[quasigroup]] |
|||
|Abelian group |
|||
|[[Monoid]] |
|||
|Abelian group |
|||
|[[quasigroup]] |
|||
|Abelian group |
|||
|[[quasigroup]] |
|||
|Abelian group |
|||
|} |
|||
==Algebraic structures== |
==Algebraic structures== |
||
{{seesubarticle|Algebraic structure}} |
{{seesubarticle|Algebraic structure}} |
||
Many algebraic structures are obtained by generalizing the familiar operations used when working with the [[integers]] and [[real numbers]]. |
Many algebraic structures are obtained by generalizing the familiar operations used when working with the [[integers]] and [[real numbers]]. |
||
Revision as of 14:02, 21 February 2006
- This article is about the branch of mathematics. For other uses of the term see algebra (disambiguation).
Algebra (Arabic: al-jabr) is a branch of mathematics which studies structure and quantity. Elementary algebra is often taught in high school and gives an introduction into the basic ideas of algebra: studying what happens when one adds and multiplies numbers and how one can make polynomials and find their roots.
Algebra is much broader than arithmetic and can be generalized. Rather than working on numbers, one can work over symbols or elements. Addition and multiplication are viewed as general operations, and their precise definitions lead to structures called groups, rings and fields.
Together with geometry and analysis, algebra is one of the three main branches of mathematics.
Classification
Algebra may be roughly divided into the following categories:
- elementary algebra, in which the properties of operations on the real number system are recorded using symbols as "place holders" to denote constants and variables, and the rules governing mathematical expressions and equations involving these symbols are studied (note that this usually includes the subject matter of courses called intermediate algebra and college algebra);
- abstract algebra, sometimes also called modern algebra, in which algebraic structures such as groups, rings and fields are axiomatically defined and investigated;
- linear algebra, in which the specific properties of vector spaces are studied (including matrices);
- universal algebra, in which properties common to all algebraic structures are studied.
In advanced studies, axiomatic algebraic systems like groups, rings, fields, and algebras over a field are investigated in the presence of a natural geometric structure (a topology) which is compatible with the algebraic structure. The list includes:
- Normed linear spaces
- Banach spaces
- Hilbert spaces
- Banach algebras
- Normed algebras
- Topological algebras
- Topological groups
Elementary algebra
Elementary algebra is the most basic form of algebra taught to students who are presumed to have no knowledge of mathematics beyond the basic principles of arithmetic. While in arithmetic only numbers and their arithmetical operations (such as +, −, ×, ÷) occur, in algebra one also uses symbols (such as a, x, y) to denote numbers. This is useful because:
- It allows the general formulation of arithmetical laws (such as for all a and b), and thus is the first step to a systematic exploration of the properties of the real number system.
- It allows the reference to "unknown" numbers, the formulation of equations and the study of how to solve these (for instance "find a number x such that ).
- It allows the formulation of functional relationships (such as "if you sell x tickets, then your profit will be dollars").
Abstract algebra
- Main article: Abstract algebra; see also algebraic structures.
Abstract algebra extends the familiar concepts found in elementary algebra and arithmetic of numbers to more general concepts.
Sets: Rather than just considering the different types of numbers, abstract algebra deals with the more general concept of sets: a collection of objects called elements. All the familiar types of numbers are sets. More general sets include the set of all two by two matrices, the set of all second degree polynomials (ax2+bx+c), the set of all two dimensional vectors in the plane, and the various finite groups such as the cyclic groups which are the group of integers module n. Set theory is a branch of logic and not technically a branch of algebra.
Binary operations: The notion of addition (+) is abstracted to give a binary operation, * say. For two elements a and b in a set S a*b gives another element in the set, (technically this condition is called closure). Addition (+), subtraction (-), multiplication (×), and division (÷) are all binary operations as in addition and multiplication of matrices, vectors, and polynomials.
Identity elements: Zero and one are abstracted to give the notion of an identity element. Zero is the identity element for addition and one is the identity element for multiplication. For a general binary operator * the identity element e must satisfy a*e=a and e*a=a. This holds for addition as a+0=a, and 0+a=a and multiplication a×1=a, 1×a=a. However, if we take the positive natural numbers and addition, there is no identity element.
Inverse elements: The negative numbers gives rise to the concept of an inverse elements. For addition the inverse of a is -a, and for multiplication the inverse is 1/a. A general inverse element a-1 must satisfy the property that a*a-1=e and a-1*a=e.
Associativity: The integers with addition have a property called associativity: (2+3)+4=2+(3+4). In general this becomes (a+b)+c=a+(b+c). This property is shared by most binary operations, but not subtraction or division.
Commutativity: The integers with addition also have a property called commutativity: 2+3=3+2. In general this becomes a+b=b+a. Only some binary operations have this property, it holds for the integers with addition and multiplication, but it does not hold for matrix multiplication.
Groups
- Main article: group; see also group theory, examples of groups
Combining the above concepts gives one of the most important structures in mathematics: a group. A group consists of:
- a set S of elements,
- a(closed) binary operation (*)
- an identity element exists,
- every element has an inverse,
- the operation is associative.
If commutativity is include as well then we obtain an Abelian group.
For example, the set of integers under the operation of addition is a group. In this group, the identity element is 0 and the inverse of any element a is its negation, -a. The associativity requirement is met since for any integers a, b and c, .
The non-zero rational numbers form a group under multiplication. Here, the identity element is 1, since for any any rational number a. The inverse of a is , since .
The integers under the multiplication operation, however, do not form a group. This is because, in general, the multiplicative inverse of an integer is not an integer. For example, 4 is an integer, but its multiplicative inverse is 1/4, which is not an integer.
The theory of groups is studied in group theory. A major result in this theory is the Classification of finite simple groups a vast body of work which classified all the is a vast body of work, mostly published between around 1955 and 1983, which is thought to classify all of the finite simple groups.
Examples of groups | ||||||||||
Set: | Natural numbers | Integers | Rational numbers (also real and complex numbers) | Integers mod 3: {0,1,2} | ||||||
---|---|---|---|---|---|---|---|---|---|---|
operation | + (including zero) | × (excluding zero) | + | × (excluding zero) | + | − | × (excluding zero) | ÷ (excluding zero) | + | |
Closed | Yes | Yes | Yes | Yes | Yes | Yes | Yes | Yes | Yes | |
identity | 0 | 1 | 0 | 1 | 0 | NA | 1 | NA | 0 | |
inverse | NA | NA | -1 | NA | -1 | NA | 1/a | NA | 0,2,1 receptively | |
Associative | Yes | Yes | Yes | Yes | Yes | No | Yes | No | Yes | |
Commutative | Yes | Yes | Yes | Yes | Yes | No | Yes | No | Yes | |
Structure | semigroup | quasigroup | Abelian group | Monoid | Abelian group | quasigroup | Abelian group | quasigroup | Abelian group |
Algebraic structures
Many algebraic structures are obtained by generalizing the familiar operations used when working with the integers and real numbers.
A group is a generalization of the structure of the integers with addition. Technically, a group is a set S and a binary operation that satisfy the following requirements:
- Existence of a identity element: there is an e such that and for any element a
- Existence of inverse elements: for every element a, there must be an element such that and
- Associativity: for any elements a, b, and c,
(Note that closure {i.e. that is an element for all a and b} is implied by the definition of the operation.)
For example, the set of integers under the operation of addition is a group. In this group, the identity element is 0 and the inverse of any element a is its negation, -a. The associativity requirement is met since for any integers a, b and c, .
The non-zero rational numbers form a group under multiplication. Here, the identity element is 1, since for any any rational number a. The inverse of a is , since .
The integers under the multiplication operation, however, do not form a group. This is because, in general, the multiplicative inverse of an integer is not an integer. For example, 4 is an integer, but its multiplicative inverse is 1/4, which is not an integer.
Many other types of algebraic structures exist. Among the most common are rings, fields, and monoids. These different structures can be used to model different types of mathematical objects. Different algebraic structures are often related. For example, a group is a specific kind of monoid, and rings and fields are similar to groups, but with more operations.
Algebras
The word algebra is also used for various algebraic structures:
- algebra over a field
- algebra over a set
- Boolean algebra
- sigma-algebra
- F-algebra and F-coalgebra in category theory
History
The origins of algebra can be traced to the cultures of the Persians, ancient Egyptians and Babylonians who used an early type of algebra to solve linear, quadratic, and indeterminate equations more than 3,000 years ago.
- Circa 800 BC: Indian mathematician Baudhayana, in his Baudhayana Sulba Sutra, finds geometric solutions of linear equations and quadratic equations of the forms ax2 = c and ax2 + bx = c.
- Circa 600 BC: Indian mathematician Apastamba, in his Apastamba Sulba Sutra, solves the general linear equation.
- Circa 300 BC: Greek mathematician Euclid, who taught and died at Alexandria in Egypt, in Book 2 of his Elements addresses quadratic equations, although in a strictly geometrical fashion.
- Circa 100 BC: Algebraic equations are treated in the Chinese mathematics book Jiuzhang suanshu, The Nine Chapters of Mathematical Art.
- Circa 150 AD: Greek mathematician Hero of Alexandria treats algebraic equations in three volumes of mathematics.
- Circa 200: Greek mathematician Diophantus, often referred to as the "father of algebra", writes his famous Arithmetica, a work featuring solutions of algebraic equations and on the theory of numbers.
- 476: Indian mathematician Aryabhata, obtains whole number solutions to linear equations by a method equivalent to the modern one. Indian mathematicians recognized that quadratic equations have two roots, and included negative as well as irrational roots. They also treated indeterminate quadratic equations.
- 628: Indian mathematician Brahmagupta, invents the method of solving indeterminate equations of the second degree, and also gives rules for solving linear and quadratic equations.
- 820: The word algebra is derived from an operation described in the treatise first written by Persian mathematician Al-Khwarizmi titled: Al-Jabr wa-al-Muqabilah meaning The book of summary concerning calculating by transposition and reduction. The word al-jabr means "reunion". Khwarizmi is often considered as the "father of modern algebra". Much of Khwarizmi's works on reduction was included in the book and added to many methods we have in Algebra now.
- 1114: Indian mathematician Bhaskara II, who wrote the text Bijaganita (algebra), was the first to recognize that a positive number has two square roots.
- 1202: Algebra was introduced to Europe largely through the work of Leonardo Fibonacci of Pisa in his work Liber Abaci .
References
- Ziauddin Sardar, Jerry Ravetz, and Borin Van Loon, Introducing Mathematics (Totem Books, 1999).
- Donald R. Hill, Islamic Science and Engineering (Edinburgh University Press, 1994).
- George Gheverghese Joseph, The Crest of the Peacock : The Non-European Roots of Mathematics (Princeton University Press, 2000).
See also
- Fundamental theorem of algebra (which is really a theorem of mathematical analysis, not of algebra)
- Diophantus, "father of algebra"
- Mohammed al-Khwarizmi, also known as "father of modern algebra". [1]
- Computer algebra system
External links
- Explanation of Basic Topics
- Sparknotes' Review of Algebra I and II
- Understanding Algebra. An online algebra text by James W. Brennan.
- Algebra--the basic ideas First of 6 parts in a short course on basic algebra at the high school level.
- Highlights in the history of algebra