|
Mahler's Compactness Theorem
In mathematics, Mahler's compactness theorem, proved by , is a foundational result on lattices in Euclidean space, characterising sets of lattices that are 'bounded' in a certain definite sense. Looked at another way, it explains the ways in which a lattice could degenerate (''go off to infinity'') in a sequence of lattices. In intuitive terms it says that this is possible in just two ways: becoming ''coarse-grained'' with a fundamental domain that has ever larger volume; or containing shorter and shorter vectors. It is also called his selection theorem, following an older convention used in naming compactness theorems, because they were formulated in terms of sequential compactness (the possibility of selecting a convergent subsequence). Let ''X'' be the space :\mathrm_n(\mathbb)/\mathrm_n(\mathbb) that parametrises lattices in \mathbb^n, with its quotient topology. There is a well-defined function Δ on ''X'', which is the absolute value of the determinant of a matrix †... [...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 poin ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Relatively Compact
In mathematics, a relatively compact subspace (or relatively compact subset, or precompact subset) of a topological space is a subset whose closure is compact. Properties Every subset of a compact topological space is relatively compact (since a closed subset of a compact space is compact). And in an arbitrary topological space every subset of a relatively compact set is relatively compact. Every compact subset of a Hausdorff space is relatively compact. In a non-Hausdorff space, such as the particular point topology on an infinite set, the closure of a compact subset is ''not'' necessarily compact; said differently, a compact subset of a non-Hausdorff space is not necessarily relatively compact. Every compact subset of a (possibly non-Hausdorff) topological vector space is complete and relatively compact. In the case of a metric topology, or more generally when sequences may be used to test for compactness, the criterion for relative compactness becomes that any sequence i ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Discrete Groups
Discrete may refer to: *Discrete particle or quantum in physics, for example in quantum theory *Discrete device, an electronic component with just one circuit element, either passive or active, other than an integrated circuit * Discrete group, a group with the discrete topology * Discrete category, category whose only arrows are identity arrows *Discrete mathematics, the study of structures without continuity * Discrete optimization, a branch of optimization in applied mathematics and computer science * Discrete probability distribution, a random variable that can be counted *Discrete space, a simple example of a topological space * Discrete spline interpolation, the discrete analog of ordinary spline interpolation *Discrete time, non-continuous time, which results in discrete-time samples *Discrete variable In mathematics and statistics, a quantitative variable may be continuous or discrete if they are typically obtained by ''measuring'' or ''counting'', respectively. If it ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Geometry Of Numbers
Geometry of numbers is the part of number theory which uses geometry for the study of algebraic numbers. Typically, a ring of algebraic integers is viewed as a lattice in \mathbb R^n, and the study of these lattices provides fundamental information on algebraic numbers. The geometry of numbers was initiated by . The geometry of numbers has a close relationship with other fields of mathematics, especially functional analysis and Diophantine approximation, the problem of finding rational numbers that approximate an irrational quantity. Minkowski's results Suppose that \Gamma is a lattice in n-dimensional Euclidean space \mathbb^n and K is a convex centrally symmetric body. Minkowski's theorem, sometimes called Minkowski's first theorem, states that if \operatorname (K)>2^n \operatorname(\mathbb^n/\Gamma), then K contains a nonzero vector in \Gamma. The successive minimum \lambda_k is defined to be the inf of the numbers \lambda such that \lambda K contains k linearly inde ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mumford's Compactness Theorem
In mathematics, Mumford's compactness theorem states that the space of compact Riemann surfaces of fixed genus ''g'' > 1 with no closed geodesics of length less than some fixed ''ε'' > 0 in the Poincaré metric is compact. It was proved by as a consequence of a theorem about the compactness of sets of discrete subgroups of semisimple Lie groups generalizing Mahler's compactness theorem In mathematics, Mahler's compactness theorem, proved by , is a foundational result on lattices in Euclidean space, characterising sets of lattices that are 'bounded' in a certain definite sense. Looked at another way, it explains the ways in whic .... References * Riemann surfaces Kleinian groups Compactness theorems {{Riemannian-geometry-stub ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
David Mumford
David Bryant Mumford (born 11 June 1937) is an American mathematician known for his work in algebraic geometry and then for research into vision and pattern theory. He won the Fields Medal and was a MacArthur Fellow. In 2010 he was awarded the National Medal of Science. He is currently a University Professor Emeritus in the Division of Applied Mathematics at Brown University. Early life Mumford was born in Worth, West Sussex in England, of an English father and American mother. His father William started an experimental school in Tanzania and worked for the then newly created United Nations. He attended Phillips Exeter Academy, where he received a Westinghouse Science Talent Search prize for his relay-based computer project. Mumford then went to Harvard University, where he became a student of Oscar Zariski. At Harvard, he became a Putnam Fellow in 1955 and 1956. He completed his PhD in 1961, with a thesis entitled ''Existence of the moduli scheme for curves of any g ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Semisimple Lie Group
In mathematics, a Lie algebra is semisimple if it is a direct sum of simple Lie algebras. (A simple Lie algebra is a non-abelian Lie algebra without any non-zero proper ideals). Throughout the article, unless otherwise stated, a Lie algebra is a finite-dimensional Lie algebra over a field of characteristic 0. For such a Lie algebra \mathfrak g, if nonzero, the following conditions are equivalent: *\mathfrak g is semisimple; *the Killing form, κ(x,y) = tr(ad(''x'')ad(''y'')), is non-degenerate; *\mathfrak g has no non-zero abelian ideals; *\mathfrak g has no non-zero solvable ideals; * the radical (maximal solvable ideal) of \mathfrak g is zero. Significance The significance of semisimplicity comes firstly from the Levi decomposition, which states that every finite dimensional Lie algebra is the semidirect product of a solvable ideal (its radical) and a semisimple algebra. In particular, there is no nonzero Lie algebra that is both solvable and semisimple. Semisimple Lie ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Systolic Geometry
In mathematics, systolic geometry is the study of systolic invariants of manifolds and polyhedra, as initially conceived by Charles Loewner and developed by Mikhail Gromov, Michael Freedman, Peter Sarnak, Mikhail Katz, Larry Guth, and others, in its arithmetical, ergodic, and topological manifestations. See also a slower-paced Introduction to systolic geometry. The notion of systole The ''systole'' of a compact metric space ''X'' is a metric invariant of ''X'', defined to be the least length of a noncontractible loop in ''X'' (i.e. a loop that cannot be contracted to a point in the ambient space ''X''). In more technical language, we minimize length over free loops representing nontrivial conjugacy classes in the fundamental group of ''X''. When ''X'' is a graph, the invariant is usually referred to as the girth, ever since the 1947 article on girth by W. T. Tutte. Possibly inspired by Tutte's article, Loewner started thinking about systolic questions on surfaces in the la ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Bounded Set
:''"Bounded" and "boundary" are distinct concepts; for the latter see boundary (topology). A circle in isolation is a boundaryless bounded set, while the half plane is unbounded yet has a boundary. In mathematical analysis and related areas of mathematics, a set is called bounded if it is, in a certain sense, of finite measure. Conversely, a set which is not bounded is called unbounded. The word 'bounded' makes no sense in a general topological space without a corresponding metric. A bounded set is not necessarily a closed set and vise versa. For example, a subset ''S'' of a 2-dimensional real space R''2'' constrained by two parabolic curves ''x''2 + 1 and ''x''2 - 1 defined in a Cartesian coordinate system is a closed but is not bounded (unbounded). Definition in the real numbers A set ''S'' of real numbers is called ''bounded from above'' if there exists some real number ''k'' (not necessarily in ''S'') such that ''k'' ≥ '' s'' for all ''s'' in ''S''. The number ''k'' ... [...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' ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Invertible
In mathematics, the concept of an inverse element generalises the concepts of opposite () and reciprocal () of numbers. Given an operation denoted here , and an identity element denoted , if , one says that is a left inverse of , and that is a right inverse of . (An identity element is an element such that and for all and for which the left-hand sides are defined.) When the operation is associative, if an element has both a left inverse and a right inverse, then these two inverses are equal and unique; they are called the ''inverse element'' or simply the ''inverse''. Often an adjective is added for specifying the operation, such as in additive inverse, multiplicative inverse, and functional inverse. In this case (associative operation), an invertible element is an element that has an inverse. Inverses are commonly used in groupswhere every element is invertible, and ringswhere invertible elements are also called units. They are also commonly used for operation ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
