|
Milnor K-theory
In mathematics, Milnor K-theory is an algebraic invariant (denoted K_*(F) for a field F) defined by as an attempt to study higher algebraic K-theory in the special case of fields. It was hoped this would help illuminate the structure for algebraic and give some insight about its relationships with other parts of mathematics, such as Galois cohomology and the Grothendieck–Witt ring of quadratic forms. Before Milnor K-theory was defined, there existed ad-hoc definitions for K_1 and K_2. Fortunately, it can be shown Milnor is a part of algebraic , which in general is the easiest part to compute. Definition Motivation After the definition of the Grothendieck group K(R) of a commutative ring, it was expected there should be an infinite set of invariants K_i(R) called higher groups, from the fact there exists a short exact sequence :K(R,I) \to K(R) \to K(R/I) \to 0 which should have a continuation by a long exact sequence. Note the group on the left is relative . This led to ... [...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] |
Steinberg Group (K-theory)
In algebraic K-theory, a field of mathematics, the Steinberg group \operatorname(A) of a ring A is the universal central extension of the commutator subgroup of the stable general linear group of A . It is named after Robert Steinberg, and it is connected with lower K -groups, notably K_ and K_ . Definition Abstractly, given a ring A , the Steinberg group \operatorname(A) is the universal central extension of the commutator subgroup of the stable general linear group (the commutator subgroup is perfect and so has a universal central extension). Presentation using generators and relations A concrete presentation using generators and relations is as follows. Elementary matrices — i.e. matrices of the form (\lambda) := \mathbf + (\lambda) , where \mathbf is the identity matrix, (\lambda) is the matrix with \lambda in the (p,q) -entry and zeros elsewhere, and p \neq q — satisfy the following relations, called the Steinberg relations: : \begin e_(\lamb ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Real Number
In mathematics, a real number is a number that can be used to measure a ''continuous'' one-dimensional quantity such as a distance, duration or temperature. Here, ''continuous'' means that values can have arbitrarily small variations. Every real number can be almost uniquely represented by an infinite decimal expansion. The real numbers are fundamental in calculus (and more generally in all mathematics), in particular by their role in the classical definitions of limits, continuity and derivatives. The set of real numbers is denoted or \mathbb and is sometimes called "the reals". The adjective ''real'' in this context was introduced in the 17th century by René Descartes to distinguish real numbers, associated with physical reality, from imaginary numbers (such as the square roots of ), which seemed like a theoretical contrivance unrelated to physical reality. The real numbers include the rational numbers, such as the integer and the fraction . The rest of the real number ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Finite Field
In mathematics, a finite field or Galois field (so-named in honor of Évariste Galois) is a field that contains a finite number of elements. As with any field, a finite field is a set on which the operations of multiplication, addition, subtraction and division are defined and satisfy certain basic rules. The most common examples of finite fields are given by the integers mod when is a prime number. The ''order'' of a finite field is its number of elements, which is either a prime number or a prime power. For every prime number and every positive integer there are fields of order p^k, all of which are isomorphic. Finite fields are fundamental in a number of areas of mathematics and computer science, including number theory, algebraic geometry, Galois theory, finite geometry, cryptography and coding theory. Properties A finite field is a finite set which is a field; this means that multiplication, addition, subtraction and division (excluding division by zero) are ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Motivic Homotopy Theory
In music, a motif IPA: ( /moʊˈtiːf/) (also motive) is a short musical phrase, a salient recurring figure, musical fragment or succession of notes that has some special importance in or is characteristic of a composition: "The motive is the smallest structural unit possessing thematic identity". The '' Encyclopédie de la Pléiade'' regards it as a "melodic, rhythmic, or harmonic cell", whereas the 1958 ''Encyclopédie Fasquelle'' maintains that it may contain one or more cells, though it remains the smallest analyzable element or phrase within a subject. It is commonly regarded as the shortest subdivision of a theme or phrase that still maintains its identity as a musical idea. "The smallest structural unit possessing thematic identity". Grove and Larousse also agree that the motif may have harmonic, melodic and/or rhythmic aspects, Grove adding that it "is most often thought of in melodic terms, and it is this aspect of the motif that is connoted by the term 'f ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Motivic Cohomology
Motivic cohomology is an invariant of algebraic varieties and of more general schemes. It is a type of cohomology related to motives and includes the Chow ring of algebraic cycles as a special case. Some of the deepest problems in algebraic geometry and number theory are attempts to understand motivic cohomology. Motivic homology and cohomology Let ''X'' be a scheme of finite type over a field ''k''. A key goal of algebraic geometry is to compute the Chow groups of ''X'', because they give strong information about all subvarieties of ''X''. The Chow groups of ''X'' have some of the formal properties of Borel–Moore homology in topology, but some things are missing. For example, for a closed subscheme ''Z'' of ''X'', there is an exact sequence of Chow groups, the localization sequence :CH_i(Z) \rightarrow CH_i(X) \rightarrow CH_i(X-Z) \rightarrow 0, whereas in topology this would be part of a long exact sequence. This problem was resolved by generalizing Chow groups to a bigrad ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Daniel Quillen
Daniel Gray "Dan" Quillen (June 22, 1940 – April 30, 2011) was an American mathematician. He is known for being the "prime architect" of higher algebraic ''K''-theory, for which he was awarded the Cole Prize in 1975 and the Fields Medal in 1978. From 1984 to 2006, he was the Waynflete Professor of Pure Mathematics at Magdalen College, Oxford. Education and career Quillen was born in Orange, New Jersey, and attended Newark Academy. He entered Harvard University, where he earned both his AB, in 1961, and his PhD in 1964; the latter completed under the supervision of Raoul Bott, with a thesis in partial differential equations. He was a Putnam Fellow in 1959. Quillen obtained a position at the Massachusetts Institute of Technology after completing his doctorate. He also spent a number of years at several other universities. He visited France twice: first as a Sloan Fellow in Paris, during the academic year 1968–69, where he was greatly influenced by Grothendieck, and the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Bloch's Higher Chow Group
In algebraic geometry, Bloch's higher Chow groups, a generalization of Chow group, is a precursor and a basic example of motivic cohomology (for smooth varieties). It was introduced by Spencer Bloch and the basic theory has been developed by Bloch and Marc Levine. In more precise terms, a theorem of Voevodsky implies: for a smooth scheme ''X'' over a field and integers ''p'', ''q'', there is a natural isomorphism :\operatorname^p(X; \mathbb(q)) \simeq \operatorname^q(X, 2q - p) between motivic cohomology groups and higher Chow groups. Motivation One of the motivations for higher Chow groups comes from homotopy theory. In particular, if \alpha,\beta \in Z_*(X) are algebraic cycles in X which are rationally equivalent via a cycle \gamma \in Z_*(X\times \Delta^1), then \gamma can be thought of as a path between \alpha and \beta, and the higher Chow groups are meant to encode the information of higher homotopy coherence. For example,\text^*(X,0)can be thought of as the homotopy clas ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Real Closed Field
In mathematics, a real closed field is a field ''F'' that has the same first-order properties as the field of real numbers. Some examples are the field of real numbers, the field of real algebraic numbers, and the field of hyperreal numbers. Definitions A real closed field is a field ''F'' in which any of the following equivalent conditions is true: #''F'' is elementarily equivalent to the real numbers. In other words, it has the same first-order properties as the reals: any sentence in the first-order language of fields is true in ''F'' if and only if it is true in the reals. #There is a total order on ''F'' making it an ordered field such that, in this ordering, every positive element of ''F'' has a square root in ''F'' and any polynomial of odd degree with coefficients in ''F'' has at least one root in ''F''. #''F'' is a formally real field such that every polynomial of odd degree with coefficients in ''F'' has at least one root in ''F'', and for every element ''a'' of ''F'' ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
If And Only If
In logic and related fields such as mathematics and philosophy, "if and only if" (shortened as "iff") is a biconditional logical connective between statements, where either both statements are true or both are false. The connective is biconditional (a statement of material equivalence), and can be likened to the standard material conditional ("only if", equal to "if ... then") combined with its reverse ("if"); hence the name. The result is that the truth of either one of the connected statements requires the truth of the other (i.e. either both statements are true, or both are false), though it is controversial whether the connective thus defined is properly rendered by the English "if and only if"—with its pre-existing meaning. For example, ''P if and only if Q'' means that ''P'' is true whenever ''Q'' is true, and the only case in which ''P'' is true is if ''Q'' is also true, whereas in the case of ''P if Q'', there could be other scenarios where ''P'' is true and ''Q'' is ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mathematical Proof
A mathematical proof is an inferential argument for a mathematical statement, showing that the stated assumptions logically guarantee the conclusion. The argument may use other previously established statements, such as theorems; but every proof can, in principle, be constructed using only certain basic or original assumptions known as axioms, along with the accepted rules of inference. Proofs are examples of exhaustive deductive reasoning which establish logical certainty, to be distinguished from empirical arguments or non-exhaustive inductive reasoning which establish "reasonable expectation". Presenting many cases in which the statement holds is not enough for a proof, which must demonstrate that the statement is true in ''all'' possible cases. A proposition that has not been proved but is believed to be true is known as a conjecture, or a hypothesis if frequently used as an assumption for further mathematical work. Proofs employ logic expressed in mathematical symbols ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Supercommutative Algebra
In mathematics, a supercommutative (associative) algebra is a superalgebra (i.e. a Z2-graded algebra) such that for any two homogeneous elements ''x'', ''y'' we have :yx = (-1)^xy , where , ''x'', denotes the grade of the element and is 0 or 1 (in Z) according to whether the grade is even or odd, respectively. Equivalently, it is a superalgebra where the supercommutator : ,y= xy - (-1)^yx always vanishes. Algebraic structures which supercommute in the above sense are sometimes referred to as skew-commutative associative algebras to emphasize the anti-commutation, or, to emphasize the grading, graded-commutative or, if the supercommutativity is understood, simply commutative. Any commutative algebra is a supercommutative algebra if given the trivial gradation (i.e. all elements are even). Grassmann algebras (also known as exterior algebras) are the most common examples of nontrivial supercommutative algebras. The supercenter of any superalgebra is the set of elements that sup ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
