|
Hausdorff–Besicovitch Dimension
In mathematics, Hausdorff dimension is a measure of ''roughness'', or more specifically, fractal dimension, that was first introduced in 1918 by mathematician Felix Hausdorff. For instance, the Hausdorff dimension of a single point is zero, of a line segment is 1, of a square is 2, and of a cube is 3. That is, for sets of points that define a smooth shape or a shape that has a small number of corners—the shapes of traditional geometry and science—the Hausdorff dimension is an integer agreeing with the usual sense of dimension, also known as the topological dimension. However, formulas have also been developed that allow calculation of the dimension of other less simple objects, where, solely on the basis of their properties of scaling and self-similarity, one is led to the conclusion that particular objects—including fractals—have non-integer Hausdorff dimensions. Because of the significant technical advances made by Abram Samoilovitch Besicovitch allowing computation of di ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Vector Space
In mathematics and physics, a vector space (also called a linear space) is a set whose elements, often called ''vectors'', may be added together and multiplied ("scaled") by numbers called '' scalars''. Scalars are often real numbers, but can be complex numbers or, more generally, elements of any field. The operations of vector addition and scalar multiplication must satisfy certain requirements, called ''vector axioms''. The terms real vector space and complex vector space are often used to specify the nature of the scalars: real coordinate space or complex coordinate space. Vector spaces generalize Euclidean vectors, which allow modeling of physical quantities, such as forces and velocity, that have not only a magnitude, but also a direction. The concept of vector spaces is fundamental for linear algebra, together with the concept of matrix, which allows computing in vector spaces. This provides a concise and synthetic way for manipulating and studying systems of linear eq ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Ball (mathematics)
In mathematics, a ball is the solid figure bounded by a ''sphere''; it is also called a solid sphere. It may be a closed ball (including the boundary points that constitute the sphere) or an open ball (excluding them). These concepts are defined not only in three-dimensional Euclidean space but also for lower and higher dimensions, and for metric spaces in general. A ''ball'' in dimensions is called a hyperball or -ball and is bounded by a ''hypersphere'' or ()-sphere. Thus, for example, a ball in the Euclidean plane is the same thing as a disk, the area bounded by a circle. In Euclidean 3-space, a ball is taken to be the volume bounded by a 2-dimensional sphere. In a one-dimensional space, a ball is a line segment. In other contexts, such as in Euclidean geometry and informal use, ''sphere'' is sometimes used to mean ''ball''. In the field of topology the closed n-dimensional ball is often denoted as B^n or D^n while the open n-dimensional ball is \operatorname B^n or \ope ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Lebesgue Covering Dimension
In mathematics, the Lebesgue covering dimension or topological dimension of a topological space is one of several different ways of defining the dimension of the space in a topologically invariant way. Informal discussion For ordinary Euclidean spaces, the Lebesgue covering dimension is just the ordinary Euclidean dimension: zero for points, one for lines, two for planes, and so on. However, not all topological spaces have this kind of "obvious" dimension, and so a precise definition is needed in such cases. The definition proceeds by examining what happens when the space is covered by open sets. In general, a topological space ''X'' can be covered by open sets, in that one can find a collection of open sets such that ''X'' lies inside of their union. The covering dimension is the smallest number ''n'' such that for every cover, there is a refinement in which every point in ''X'' lies in the intersection of no more than ''n'' + 1 covering sets. This is the gist of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Surjective Function
In mathematics, a surjective function (also known as surjection, or onto function) is a function that every element can be mapped from element so that . In other words, every element of the function's codomain is the image of one element of its domain. It is not required that be unique; the function may map one or more elements of to the same element of . The term ''surjective'' and the related terms ''injective'' and ''bijective'' were introduced by Nicolas Bourbaki, a group of mainly French 20th-century mathematicians who, under this pseudonym, wrote a series of books presenting an exposition of modern advanced mathematics, beginning in 1935. The French word '' sur'' means ''over'' or ''above'', and relates to the fact that the image of the domain of a surjective function completely covers the function's codomain. Any function induces a surjection by restricting its codomain to the image of its domain. Every surjective function has a right inverse assuming the axiom ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Space-filling Curve
In mathematical analysis, a space-filling curve is a curve whose range contains the entire 2-dimensional unit square (or more generally an ''n''-dimensional unit hypercube). Because Giuseppe Peano (1858–1932) was the first to discover one, space-filling curves in the 2-dimensional plane are sometimes called ''Peano curves'', but that phrase also refers to the Peano curve, the specific example of a space-filling curve found by Peano. Definition Intuitively, a curve in two or three (or higher) dimensions can be thought of as the path of a continuously moving point. To eliminate the inherent vagueness of this notion, Jordan in 1887 introduced the following rigorous definition, which has since been adopted as the precise description of the notion of a ''curve'': In the most general form, the range of such a function may lie in an arbitrary topological space, but in the most commonly studied cases, the range will lie in a Euclidean space such as the 2-dimensional plane (a ''pla ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cantor's Diagonal Argument
In set theory, Cantor's diagonal argument, also called the diagonalisation argument, the diagonal slash argument, the anti-diagonal argument, the diagonal method, and Cantor's diagonalization proof, was published in 1891 by Georg Cantor as a mathematical proof that there are infinite sets which cannot be put into one-to-one correspondence with the infinite set of natural numbers. English translation: Such sets are now known as uncountable sets, and the size of infinite sets is now treated by the theory of cardinal numbers which Cantor began. The diagonal argument was not Cantor's first proof of the uncountability of the real numbers, which appeared in 1874. However, it demonstrates a general technique that has since been used in a wide range of proofs, including the first of Gödel's incompleteness theorems and Turing's answer to the ''Entscheidungsproblem''. Diagonalization arguments are often also the source of contradictions like Russell's paradox and Richard's paradox. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Real Line
In elementary mathematics, a number line is a picture of a graduated straight line (geometry), line that serves as visual representation of the real numbers. Every point of a number line is assumed to correspond to a real number, and every real number to a point. The integers are often shown as specially-marked points evenly spaced on the line. Although the image only shows the integers from –3 to 3, the line includes all real numbers, continuing forever in each direction, and also numbers that are between the integers. It is often used as an aid in teaching simple addition and subtraction, especially involving negative numbers. In advanced mathematics, the number line can be called as a real line or real number line, formally defined as the set (mathematics), set of all real numbers, viewed as a geometry, geometric space (mathematics), space, namely the Euclidean space of dimension one. It can be thought of as a vector space (or affine space), a metric space, a topological ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Real Plane
In mathematics, a plane is a Euclidean (flat), two-dimensional surface that extends indefinitely. A plane is the two-dimensional analogue of a point (zero dimensions), a line (one dimension) and three-dimensional space. Planes can arise as subspaces of some higher-dimensional space, as with one of a room's walls, infinitely extended, or they may enjoy an independent existence in their own right, as in the setting of two-dimensional Euclidean geometry. Sometimes the word ''plane'' is used more generally to describe a two-dimensional surface, for example the hyperbolic plane and elliptic plane. When working exclusively in two-dimensional Euclidean space, the definite article is used, so ''the'' plane refers to the whole space. Many fundamental tasks in mathematics, geometry, trigonometry, graph theory, and graphing are performed in a two-dimensional space, often in the plane. Euclidean geometry Euclid set forth the first great landmark of mathematical thought, an axiomatic t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cardinality
In mathematics, the cardinality of a set is a measure of the number of elements of the set. For example, the set A = \ contains 3 elements, and therefore A has a cardinality of 3. Beginning in the late 19th century, this concept was generalized to infinite sets, which allows one to distinguish between different types of infinity, and to perform arithmetic on them. There are two approaches to cardinality: one which compares sets directly using bijections and injections, and another which uses cardinal numbers. The cardinality of a set is also called its size, when no confusion with other notions of size is possible. The cardinality of a set A is usually denoted , A, , with a vertical bar on each side; this is the same notation as absolute value, and the meaning depends on context. The cardinality of a set A may alternatively be denoted by n(A), , \operatorname(A), or \#A. History A crude sense of cardinality, an awareness that groups of things or events compare with other grou ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Minkowski–Bouligand Dimension
450px, Estimating the box-counting dimension of the coast of Great Britain In fractal geometry, the Minkowski–Bouligand dimension, also known as Minkowski dimension or box-counting dimension, is a way of determining the fractal dimension of a set ''S'' in a Euclidean space R''n'', or more generally in a metric space (''X'', ''d''). It is named after the Polish mathematician Hermann Minkowski and the French mathematician Georges Bouligand. To calculate this dimension for a fractal ''S'', imagine this fractal lying on an evenly spaced grid and count how many boxes are required to cover the set. The box-counting dimension is calculated by seeing how this number changes as we make the grid finer by applying a box-counting algorithm. Suppose that ''N''(''ε'') is the number of boxes of side length ''ε'' required to cover the set. Then the box-counting dimension is defined as : \dim_\text(S) := \lim_ \frac . Roughly speaking, this means that the dimension is the exponent ''d ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Natural Logarithm
The natural logarithm of a number is its logarithm to the base of the mathematical constant , which is an irrational and transcendental number approximately equal to . The natural logarithm of is generally written as , , or sometimes, if the base is implicit, simply . Parentheses are sometimes added for clarity, giving , , or . This is done particularly when the argument to the logarithm is not a single symbol, so as to prevent ambiguity. The natural logarithm of is the power to which would have to be raised to equal . For example, is , because . The natural logarithm of itself, , is , because , while the natural logarithm of is , since . The natural logarithm can be defined for any positive real number as the area under the curve from to (with the area being negative when ). The simplicity of this definition, which is matched in many other formulas involving the natural logarithm, leads to the term "natural". The definition of the natural logarithm can then b ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
