Editing Emmy Noether (section)

===Background on abstract algebra and ''begriffliche Mathematik'' (conceptual mathematics)===
Two of the most basic objects in abstract algebra are [[Group (mathematics)|groups]] and [[Ring (mathematics)|rings]]:
* A ''group'' consists of a set of [[Element (mathematics)|elements]] and a single operation which combines a first and a second element and returns a third. The operation must satisfy certain constraints for it to determine a group: it must be [[Closure (mathematics)|closed]] (when applied to any pair of elements of the associated set, the generated element must also be a member of that set), it must be [[associativity|associative]], there must be an [[identity element]] (an element which, when combined with another element using the operation, results in the original element, such as by multiplying a number by one), and for every element there must be an [[inverse element]].{{sfn|Lang|2005|loc=II.§1|p=16}}{{sfn|Stewart|2015|pp=18–19}}
* A ''ring'' likewise, has a set of elements, but now has ''two'' operations. The first operation must make the set a [[commutativity|commutative]] group, and the second operation is [[Associative property|associative]] and [[distributivity|distributive]] with respect to the first operation. It may or may not be [[commutativity|commutative]]; this means that the result of applying the operation to a first and a second element is the same as to the second and first – the order of the elements does not matter.{{sfn|Stewart|2015|p=182}} If every non-zero element has a [[multiplicative inverse]] (an element {{math|''x''}} such that {{math|1=''ax'' = ''xa'' = 1}}), the ring is called a ''[[division ring]]''. A ''[[field (mathematics)|field]]'' is defined as a commutative{{efn|The nomenclature is not consistent.}} division ring. For instance, the [[integer]]s form a commutative ring whose elements are the integers, and the combining operations are addition and multiplication. Any pair of integers can be [[addition|added]] or [[multiplication|multiplied]], always resulting in another integer, and the first operation, addition, is [[commutativity|commutative]], i.e., for any elements {{math|''a''}} and {{math|''b''}} in the ring, {{math|1=''a'' + ''b'' = ''b'' + ''a''}}. The second operation, multiplication, also is commutative, but that need not be true for other rings, meaning that {{math|''a''}} combined with {{math|''b''}} might be different from {{math|''b''}} combined with {{math|''a''}}. Examples of noncommutative rings include [[matrix (mathematics)|matrices]] and [[quaternion]]s. The integers do not form a division ring, because the second operation cannot always be inverted; for example, there is no integer {{math|''a''}} such that {{math|1= 3''a'' = 1}}.{{sfn|Stewart|2015|p=183}}{{sfn|Gowers et al.|2008|p=284}}

The integers have additional properties which do not generalize to all commutative rings. An important example is the [[fundamental theorem of arithmetic]], which says that every positive integer can be factored uniquely into [[prime number]]s.{{sfn|Gowers et al.|2008|pp=699–700}} Unique factorizations do not always exist in other rings, but Noether found a unique factorization theorem, now called the [[Lasker–Noether theorem]], for the [[ideal (ring theory)|ideals]] of many rings.{{sfn|Osofsky|1994}} As detailed below, Noether's work included determining what properties ''do'' hold for all rings, devising novel analogs of the old integer theorems, and determining the minimal set of assumptions required to yield certain properties of rings.

Groups are frequently studied through ''[[group representation]]s''.{{sfn|Zee|2016|pp=89–92}} In their most general form, these consist of a choice of group, a set, and an ''action'' of the group on the set, that is, an operation which takes an element of the group and an element of the set and returns an element of the set. Most often, the set is a [[vector space]], and the group describes the [[Symmetry|symmetries]] of the vector space. For example, there is a group which represents the rigid rotations of space. Rotations are a type of symmetry of space, because the laws of physics themselves do not pick out a preferred direction.{{sfn|Peres|1993|pp=215–229}} Noether used these sorts of symmetries in her work on invariants in physics.{{sfn|Zee|2016|p=180}}

A powerful way of studying rings is through their ''[[module (mathematics)|modules]]''. A module consists of a choice of ring, another set, usually distinct from the underlying set of the ring and called the underlying set of the module, an operation on pairs of elements of the underlying set of the module, and an operation which takes an element of the ring and an element of the module and returns an element of the module.{{sfn|Gowers et al.|2008|p=285}}

The underlying set of the module and its operation must form a group. A module is a ring-theoretic version of a group representation: ignoring the second ring operation and the operation on pairs of module elements determines a group representation. The real utility of modules is that the kinds of modules that exist and their interactions, reveal the structure of the ring in ways that are not apparent from the ring itself. An important special case of this is an ''[[algebra over a field|algebra]]''.{{efn|The word <em>algebra</em> means both a [[algebra|subject within mathematics]] as well as an [[algebra over a field|object studied in the subject of algebra]].}} An algebra consists of a choice of two rings and an operation which takes an element from each ring and returns an element of the second ring. This operation makes the second ring into a module over the first.{{sfn|Lang|2002|p=121}}

Words such as "element" and "combining operation" are very general, and can be applied to many real-world and abstract situations. Any set of things that obeys all the rules for one (or two) operation(s) is, by definition, a group (or ring), and obeys all theorems about groups (or rings). Integer numbers, and the operations of addition and multiplication, are just one example. For instance, the elements might be logical propositions, where the first combining operation is [[exclusive or]] and the second is [[logical conjunction]].{{sfn|Givant|Halmos|2009|pp=14–15}} Theorems of abstract algebra are powerful because they are general; they govern many systems. It might be imagined that little could be concluded about objects defined with so few properties, but precisely therein lay Noether's gift to discover the maximum that could be concluded from a given set of properties, or conversely, to identify the minimum set, the essential properties responsible for a particular observation. Unlike most mathematicians, she did not make abstractions by generalizing from known examples; rather, she worked directly with the abstractions. In his obituary of Noether, van&nbsp;der&nbsp;Waerden recalled that
{{blockquote |The maxim by which Emmy Noether was guided throughout her work might be formulated as follows: "Any relationships between numbers, functions, and operations become transparent, generally applicable, and fully productive only after they have been isolated from their particular objects and been formulated as universally valid concepts."{{sfn|Dick|1981|p=101}} }}

This is the ''begriffliche Mathematik'' (purely conceptual mathematics) that was characteristic of Noether. This style of mathematics was consequently adopted by other mathematicians, especially in the (then new) field of abstract algebra.{{sfn|Gowers et al.|2008|p=801}}