|
Latimer–MacDuffee Theorem
The Latimer–MacDuffee theorem is a theorem in abstract algebra, a branch of mathematics. It is named after Claiborne Latimer and Cyrus Colton MacDuffee, who published it in 1933. Significant contributions to its theory were made later by Olga Taussky-Todd.. Let f be a monic, irreducible polynomial of degree n. The Latimer–MacDuffee theorem gives a one-to-one correspondence between \mathbb- similarity classes of n\times n matrices with characteristic polynomial f and the ideal classes in the order :\mathbb (f(x)). where ideals are considered equivalent if they are equal up to an overall (nonzero) rational scalar multiple. (Note that this order need not be the full ring of integers, so nonzero ideals need not be invertible.) Since an order in a number field has only finitely many ideal classes (even if it is not the maximal order, and we mean here ideals classes for all nonzero ideals, not just the invertible ones), it follows that there are only finitely many conjugacy cla ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Theorem
In mathematics, a theorem is a statement that has been proved, or can be proved. The ''proof'' of a theorem is a logical argument that uses the inference rules of a deductive system to establish that the theorem is a logical consequence of the axioms and previously proved theorems. In the mainstream of mathematics, the axioms and the inference rules are commonly left implicit, and, in this case, they are almost always those of Zermelo–Fraenkel set theory with the axiom of choice, or of a less powerful theory, such as Peano arithmetic. A notable exception is Wiles's proof of Fermat's Last Theorem, which involves the Grothendieck universes whose existence requires the addition of a new axiom to the set theory. Generally, an assertion that is explicitly called a theorem is a proved result that is not an immediate consequence of other known theorems. Moreover, many authors qualify as ''theorems'' only the most important results, and use the terms ''lemma'', ''proposition'' and ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Abstract Algebra
In mathematics, more specifically algebra, abstract algebra or modern algebra is the study of algebraic structures. Algebraic structures include groups, rings, fields, modules, vector spaces, lattices, and algebras over a field. The term ''abstract algebra'' was coined in the early 20th century to distinguish this area of study from older parts of algebra, and more specifically from elementary algebra, the use of variables to represent numbers in computation and reasoning. Algebraic structures, with their associated homomorphisms, form mathematical categories. Category theory is a formalism that allows a unified way for expressing properties and constructions that are similar for various structures. Universal algebra is a related subject that studies types of algebraic structures as single objects. For example, the structure of groups is a single object in universal algebra, which is called the ''variety of groups''. History Before the nineteenth century, algebra meant ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mathematics
Mathematics is an area of knowledge that includes the topics of numbers, formulas and related structures, shapes and the spaces in which they are contained, and quantities and their changes. These topics are represented in modern mathematics with the major subdisciplines of number theory, algebra, geometry, and analysis, respectively. There is no general consensus among mathematicians about a common definition for their academic discipline. Most mathematical activity involves the discovery of properties of abstract objects and the use of pure reason to prove them. These objects consist of either abstractions from nature orin modern mathematicsentities that are stipulated to have certain properties, called axioms. A ''proof'' consists of a succession of applications of deductive rules to already established results. These results include previously proved theorems, axioms, andin case of abstraction from naturesome basic properties that are considered true starting points of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Claiborne Latimer
Claiborne Green Latimer (1893–1960) was an American mathematician, known for the Latimer–MacDuffee theorem. Career Latimer earned his PhD in 1924 from the University of Chicago under Leonard Dickson with thesis ''Arithmetic of Generalized Quaternion Algebras''. He was an assistant professor at Tulane University for 2 years, before becoming a mathematics professor at the University of Kentucky in 1927. After 20 years at the University of Kentucky, he resigned in 1947 and became a professor at Emory University Emory University is a private research university in Atlanta, Georgia. Founded in 1836 as "Emory College" by the Methodist Episcopal Church and named in honor of Methodist bishop John Emory, Emory is the second-oldest private institution of .... Latimer was an amateur photographer; some of his photographs are preserved in the archives of the University of Kentucky and Emory University. References 1893 births 1960 deaths 20th-century American mathematicians ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cyrus Colton MacDuffee
Cyrus Colton MacDuffee (June 29, 1895 – August 21, 1961) from Oneida, New York was a professor of mathematics at University of Wisconsin. He wrote a number of influential research papers in abstract algebra. MacDuffee served on the Council of the American Mathematical Society (A.M.S.), was editor of the '' Transactions of the A.M.S.'', and served as president of the Mathematical Association of America (M.A.A). MacDuffee obtained his B.S. degree in 1917 from Colgate University and a Ph.D. in 1922 from the University of Chicago ; his thesis was on Nonassociative algebras under the direction of Leonard E. Dickson. In 1935, MacDuffee joined the University of Wisconsin, where he remained until his death in 1961. He served as chair of the department (1951–56). Later, Wisconsin endowed a university chair under his name. Prior to joining the University of Wisconsin, he served at Princeton and Ohio State. He guided 30 Ph.D. students, among them D. R. Fulkerson, H. J. Ryser, and Bonnie ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Annals Of Mathematics
The ''Annals of Mathematics'' is a mathematical journal published every two months by Princeton University and the Institute for Advanced Study. History The journal was established as ''The Analyst'' in 1874 and with Joel E. Hendricks as the founding editor-in-chief. It was "intended to afford a medium for the presentation and analysis of any and all questions of interest or importance in pure and applied Mathematics, embracing especially all new and interesting discoveries in theoretical and practical astronomy, mechanical philosophy, and engineering". It was published in Des Moines, Iowa, and was the earliest American mathematics journal to be published continuously for more than a year or two. This incarnation of the journal ceased publication after its tenth year, in 1883, giving as an explanation Hendricks' declining health, but Hendricks made arrangements to have it taken over by new management, and it was continued from March 1884 as the ''Annals of Mathematics''. The n ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Olga Taussky-Todd
Olga Taussky-Todd (August 30, 1906, Olomouc, Austria-Hungary (present-day Olomouc, Czech Republic) – October 7, 1995, Pasadena, California) was an Austrian and later Czech-American mathematician. She published more than 300 research papers on algebraic number theory, integral matrices, and matrices in algebra and analysis. Early life Olga Taussky was born into a Jewish family in what is now Olomouc, Czech Republic, on August 30, 1906. Her father, Julius David Taussky, was an industrial chemist and her mother, Ida Pollach, was a housewife. She was the second of three children. Her father preferred that, if his daughters had careers, they be in the arts, but they all went into the sciences. Ilona, three years older than Olga, became a consulting chemist in the glyceride industry, and Hertha, three years younger than Olga, became a pharmacist and later a clinical chemist at Cornell University Medical College in New York City. At the age of three, her family moved to Vienna and li ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Monic Polynomial
In algebra, a monic polynomial is a single-variable polynomial (that is, a univariate polynomial) in which the leading coefficient (the nonzero coefficient of highest degree) is equal to 1. Therefore, a monic polynomial has the form: :x^n+c_x^+\cdots+c_2x^2+c_1x+c_0 Univariate polynomials If a polynomial has only one indeterminate (univariate polynomial), then the terms are usually written either from highest degree to lowest degree ("descending powers") or from lowest degree to highest degree ("ascending powers"). A univariate polynomial in ''x'' of degree ''n'' then takes the general form displayed above, where : ''c''''n'' ≠ 0, ''c''''n''−1, ..., ''c''2, ''c''1 and ''c''0 are constants, the coefficients of the polynomial. Here the term ''c''''n''''x''''n'' is called the ''leading term'', and its coefficient ''c''''n'' the ''leading coefficient''; if the leading coefficient , the univariate polynomial is called monic. Properties Multiplicatively closed The set ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Irreducible Polynomial
In mathematics, an irreducible polynomial is, roughly speaking, a polynomial that cannot be factored into the product of two non-constant polynomials. The property of irreducibility depends on the nature of the coefficients that are accepted for the possible factors, that is, the field to which the coefficients of the polynomial and its possible factors are supposed to belong. For example, the polynomial is a polynomial with integer coefficients, but, as every integer is also a real number, it is also a polynomial with real coefficients. It is irreducible if it is considered as a polynomial with integer coefficients, but it factors as \left(x - \sqrt\right)\left(x + \sqrt\right) if it is considered as a polynomial with real coefficients. One says that the polynomial is irreducible over the integers but not over the reals. Polynomial irreducibility can be considered for polynomials with coefficients in an integral domain, and there are two common definitions. Most often, a p ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Bijection
In mathematics, a bijection, also known as a bijective function, one-to-one correspondence, or invertible function, is a function between the elements of two sets, where each element of one set is paired with exactly one element of the other set, and each element of the other set is paired with exactly one element of the first set. There are no unpaired elements. In mathematical terms, a bijective function is a one-to-one (injective) and onto (surjective) mapping of a set ''X'' to a set ''Y''. The term ''one-to-one correspondence'' must not be confused with ''one-to-one function'' (an injective function; see figures). A bijection from the set ''X'' to the set ''Y'' has an inverse function from ''Y'' to ''X''. If ''X'' and ''Y'' are finite sets, then the existence of a bijection means they have the same number of elements. For infinite sets, the picture is more complicated, leading to the concept of cardinal number—a way to distinguish the various sizes of infinite sets. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Matrix Similarity
In linear algebra, two ''n''-by-''n'' matrices and are called similar if there exists an invertible ''n''-by-''n'' matrix such that B = P^ A P . Similar matrices represent the same linear map under two (possibly) different bases, with being the change of basis matrix. A transformation is called a similarity transformation or conjugation of the matrix . In the general linear group, similarity is therefore the same as conjugacy, and similar matrices are also called conjugate; however, in a given subgroup of the general linear group, the notion of conjugacy may be more restrictive than similarity, since it requires that be chosen to lie in . Motivating example When defining a linear transformation, it can be the case that a change of basis can result in a simpler form of the same transformation. For example, the matrix representing a rotation in when the axis of rotation is not aligned with the coordinate axis can be complicated to compute. If the axis of rotation were ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Matrix (mathematics)
In mathematics, a matrix (plural matrices) is a rectangular array or table of numbers, symbols, or expressions, arranged in rows and columns, which is used to represent a mathematical object or a property of such an object. For example, \begin1 & 9 & -13 \\20 & 5 & -6 \end is a matrix with two rows and three columns. This is often referred to as a "two by three matrix", a "-matrix", or a matrix of dimension . Without further specifications, matrices represent linear maps, and allow explicit computations in linear algebra. Therefore, the study of matrices is a large part of linear algebra, and most properties and operations of abstract linear algebra can be expressed in terms of matrices. For example, matrix multiplication represents composition of linear maps. Not all matrices are related to linear algebra. This is, in particular, the case in graph theory, of incidence matrices, and adjacency matrices. ''This article focuses on matrices related to linear algebra, and, unle ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
.PNG "Click for more on -> Theorem")
