|
Finite-dimensional Algebra
In mathematics, the dimension of a vector space ''V'' is the cardinality (i.e., the number of vectors) of a basis of ''V'' over its base field. p. 44, §2.36 It is sometimes called Hamel dimension (after Georg Hamel) or algebraic dimension to distinguish it from other types of dimension. For every vector space there exists a basis, and all bases of a vector space have equal cardinality; as a result, the dimension of a vector space is uniquely defined. We say V is if the dimension of V is finite, and if its dimension is infinite. The dimension of the vector space V over the field F can be written as \dim_F(V) or as : F read "dimension of V over F". When F can be inferred from context, \dim(V) is typically written. Examples The vector space \R^3 has \left\ as a standard basis, and therefore \dim_(\R^3) = 3. More generally, \dim_(\R^n) = n, and even more generally, \dim_(F^n) = n for any field F. The complex numbers \Complex are both a real and complex vector space; w ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Dimension Levels
In physics and mathematics, the dimension of a Space (mathematics), mathematical space (or Mathematical object, object) is informally defined as the minimum number of coordinates needed to specify any Point (geometry), point within it. Thus, a Line (geometry), line has a One-dimensional space, dimension of one (1D) because only one coordinate is needed to specify a point on itfor example, the point at 5 on a number line. A Surface (mathematics), surface, such as the Boundary (mathematics), boundary of a Cylinder (geometry), cylinder or sphere, has a Two-dimensional space, dimension of two (2D) because two coordinates are needed to specify a point on itfor example, both a latitude and longitude are required to locate a point on the surface of a sphere. A two-dimensional Euclidean space is a two-dimensional space on the Euclidean plane, plane. The inside of a cube, a cylinder or a sphere is three-dimensional (3D) because three coordinates are needed to locate a point within these ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Bijective
In mathematics, a bijection, bijective function, or one-to-one correspondence is a function between two sets such that each element of the second set (the codomain) is the image of exactly one element of the first set (the domain). Equivalently, a bijection is a relation between two sets such that each element of either set is paired with exactly one element of the other set. A function is bijective if it is invertible; that is, a function f:X\to Y is bijective if and only if there is a function g:Y\to X, the ''inverse'' of , such that each of the two ways for composing the two functions produces an identity function: g(f(x)) = x for each x in X and f(g(y)) = y for each y in Y. For example, the ''multiplication by two'' defines a bijection from the integers to the even numbers, which has the ''division by two'' as its inverse function. A function is bijective if and only if it is both injective (or ''one-to-one'')—meaning that each element in the codomain is mappe ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Circular Definition
A circular definition is a type of definition that uses the term(s) being defined as part of the description or assumes that the term(s) being described are already known. There are several kinds of circular definition, and several ways of characterising the term: pragmatic, lexicographic and linguistic Linguistics is the scientific study of language. The areas of linguistic analysis are syntax (rules governing the structure of sentences), semantics (meaning), Morphology (linguistics), morphology (structure of words), phonetics (speech sounds .... Circular definitions are related to circular reasoning in that they both involve a self-referential approach. Circular definitions may be unhelpful if the audience must either already know the meaning of the key term, or if the term to be defined is used in the definition itself. In linguistics, a circular definition is a description of the meaning of a lexeme that is constructed using one or more synonymous lexemes that are al ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Identity Operator
Graph of the identity function on the real numbers In mathematics, an identity function, also called an identity relation, identity map or identity transformation, is a function that always returns the value that was used as its argument, unchanged. That is, when is the identity function, the equality is true for all values of to which can be applied. Definition Formally, if is a set, the identity function on is defined to be a function with as its domain and codomain, satisfying In other words, the function value in the codomain is always the same as the input element in the domain . The identity function on is clearly an injective function as well as a surjective function (its codomain is also its range), so it is bijective. The identity function on is often denoted by . In set theory, where a function is defined as a particular kind of binary relation, the identity function is given by the identity relation, or ''diagonal'' of . Algebraic properties If ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Trace (linear Algebra)
In linear algebra, the trace of a square matrix , denoted , is the sum of the elements on its main diagonal, a_ + a_ + \dots + a_. It is only defined for a square matrix (). The trace of a matrix is the sum of its eigenvalues (counted with multiplicities). Also, for any matrices and of the same size. Thus, similar matrices have the same trace. As a consequence, one can define the trace of a linear operator mapping a finite-dimensional vector space into itself, since all matrices describing such an operator with respect to a basis are similar. The trace is related to the derivative of the determinant (see Jacobi's formula). Definition The trace of an square matrix is defined as \operatorname(\mathbf) = \sum_^n a_ = a_ + a_ + \dots + a_ where denotes the entry on the row and column of . The entries of can be real numbers, complex numbers, or more generally elements of a field . The trace is not defined for non-square matrices. Example Let be a matrix, with \m ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Prime Ideal
In algebra, a prime ideal is a subset of a ring (mathematics), ring that shares many important properties of a prime number in the ring of Integer#Algebraic properties, integers. The prime ideals for the integers are the sets that contain all the multiple (mathematics), multiples of a given prime number, together with the zero ideal. Primitive ideals are prime, and prime ideals are both primary ideal, primary and semiprime ideal, semiprime. Prime ideals for commutative rings Definition An ideal (ring theory), ideal of a commutative ring is prime if it has the following two properties: * If and are two elements of such that their product is an element of , then is in or is in , * is not the whole ring . This generalizes the following property of prime numbers, known as Euclid's lemma: if is a prime number and if divides a product of two integers, then divides or divides . We can therefore say :A positive integer is a prime number if and only if n\Z is a prime ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Wolfgang Krull
Wolfgang Krull (26 August 1899 – 12 April 1971) was a German mathematician who made fundamental contributions to commutative algebra, introducing concepts that are now central to the subject. Krull was born and went to school in Baden-Baden. He attended the Universities of Freiburg, Rostock and finally Göttingen from 1919–1921, where he earned his doctorate under Alfred Loewy. He worked as an instructor and professor at Freiburg, then spent a decade at the University of Erlangen. In 1939, Krull moved to become chair at the University of Bonn, where he remained for the rest of his life. Wolfgang Krull was a member of the Nazi Party. His 35 doctoral students include Wilfried Brauer, Karl-Otto Stöhr and Jürgen Neukirch. See also * Cohen structure theorem * Jacobson ring * Local ring * Prime ideal * Real algebraic geometry * Regular local ring * Valuation ring * Krull dimension In commutative algebra, the Krull dimension of a commutative ring ''R'', named after Wol ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Ring (algebra)
In mathematics, a ring is an algebraic structure consisting of a set with two binary operations called ''addition'' and ''multiplication'', which obey the same basic laws as addition and multiplication of integers, except that multiplication in a ring does not need to be commutative. Ring elements may be numbers such as integers or complex numbers, but they may also be non-numerical objects such as polynomials, square matrices, functions, and power series. A ''ring'' may be defined as a set that is endowed with two binary operations called ''addition'' and ''multiplication'' such that the ring is an abelian group with respect to the addition operator, and the multiplication operator is associative, is distributive over the addition operation, and has a multiplicative identity element. (Some authors apply the term ''ring'' to a further generalization, often called a '' rng'', that omits the requirement for a multiplicative identity, and instead call the structure defined a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Krull Dimension
In commutative algebra, the Krull dimension of a commutative ring ''R'', named after Wolfgang Krull, is the supremum of the lengths of all chains of prime ideals. The Krull dimension need not be finite even for a Noetherian ring. More generally the Krull dimension can be defined for modules over possibly non-commutative rings as the deviation of the poset of submodules. The Krull dimension was introduced to provide an algebraic definition of the dimension of an algebraic variety: the dimension of the affine variety defined by an ideal ''I'' in a polynomial ring ''R'' is the Krull dimension of ''R''/''I''. A field ''k'' has Krull dimension 0; more generally, ''k'' 'x''1, ..., ''x''''n''has Krull dimension ''n''. A principal ideal domain that is not a field has Krull dimension 1. A local ring has Krull dimension 0 if and only if every element of its maximal ideal is nilpotent. There are several other ways that have been used to define the dimension of a ring. Most of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Rank Of An Abelian Group
In mathematics, the rank, Prüfer rank, or torsion-free rank of an abelian group ''A'' is the cardinality of a maximal linearly independent subset. The rank of ''A'' determines the size of the largest free abelian group contained in ''A''. If ''A'' is torsion-free then it embeds into a vector space over the rational numbers of dimension rank ''A''. For finitely generated abelian groups, rank is a strong invariant and every such group is determined up to isomorphism by its rank and torsion subgroup. Torsion-free abelian groups of rank 1 have been completely classified. However, the theory of abelian groups of higher rank is more involved. The term rank has a different meaning in the context of elementary abelian groups. Definition A subset of an abelian group ''A'' is linearly independent (over Z) if the only linear combination of these elements that is equal to zero is trivial: if : \sum_\alpha n_\alpha a_\alpha = 0, \quad n_\alpha\in\mathbb, where all but finitely man ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Length Of A Module
In algebra, the length of a module over a ring R is a generalization of the dimension of a vector space which measures its size. page 153 It is defined to be the length of the longest chain of submodules. For vector spaces (modules over a field), the length equals the dimension. If R is an algebra over a field k, the length of a module is at most its dimension as a k-vector space. In commutative algebra and algebraic geometry, a module over a Noetherian commutative ring R can have finite length only when the module has Krull dimension zero. Modules of finite length are finitely generated modules, but most finitely generated modules have infinite length. Modules of finite length are Artinian modules and are fundamental to the theory of Artinian rings. The degree of an algebraic variety inside an affine or projective space is the length of the coordinate ring of the zero-dimensional intersection of the variety with a generic linear subspace of complementary dimension. More gene ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Matroid
In combinatorics, a matroid is a structure that abstracts and generalizes the notion of linear independence in vector spaces. There are many equivalent ways to define a matroid Axiomatic system, axiomatically, the most significant being in terms of: independent sets; bases or circuits; rank functions; closure operators; and closed sets or ''flats''. In the language of partially ordered sets, a finite simple matroid is equivalent to a geometric lattice. Matroid theory borrows extensively from the terms used in both linear algebra and graph theory, largely because it is the abstraction of various notions of central importance in these fields. Matroids have found applications in geometry, topology, combinatorial optimization, network theory, and coding theory. Definition There are many Cryptomorphism, equivalent ways to define a (finite) matroid. Independent sets In terms of independence, a finite matroid M is a pair (E, \mathcal), where E is a finite set (called the ''gro ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
