|
Blaschke Selection Theorem
The Blaschke selection theorem is a result in topology and convex geometry about sequences of convex sets. Specifically, given a sequence \ of convex sets contained in a bounded set, the theorem guarantees the existence of a subsequence \ and a convex set K such that K_ converges to K in the Hausdorff metric. The theorem is named for Wilhelm Blaschke. Alternate statements * A succinct statement of the theorem is that the metric space of convex bodies is locally compact. * Using the Hausdorff metric on sets, every infinite collection of compact subsets of the unit ball has a limit point (and that limit point is itself a compact set). Application As an example of its use, the isoperimetric problem can be shown to have a solution. That is, there exists a curve of fixed length that encloses the maximum area possible. Other problems likewise can be shown to have a solution: * Lebesgue's universal covering problem Lebesgue's universal covering problem is an unsolved problem in ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Topology
In mathematics, topology (from the Greek words , and ) is concerned with the properties of a geometric object that are preserved under continuous deformations, such as stretching, twisting, crumpling, and bending; that is, without closing holes, opening holes, tearing, gluing, or passing through itself. A topological space is a set endowed with a structure, called a ''topology'', which allows defining continuous deformation of subspaces, and, more generally, all kinds of continuity. Euclidean spaces, and, more generally, metric spaces are examples of a topological space, as any distance or metric defines a topology. The deformations that are considered in topology are homeomorphisms and homotopies. A property that is invariant under such deformations is a topological property. Basic examples of topological properties are: the dimension, which allows distinguishing between a line and a surface; compactness, which allows distinguishing between a line and a circle; connectedne ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Convex Geometry
In mathematics, convex geometry is the branch of geometry studying convex sets, mainly in Euclidean space. Convex sets occur naturally in many areas: computational geometry, convex analysis, discrete geometry, functional analysis, geometry of numbers, integral geometry, linear programming, probability theory, game theory, etc. Classification According to the Mathematics Subject Classification MSC2010, the mathematical discipline ''Convex and Discrete Geometry'' includes three major branches: * general convexity * polytopes and polyhedra * discrete geometry (though only portions of the latter two are included in convex geometry). General convexity is further subdivided as follows: *axiomatic and generalized convexity *convex sets without dimension restrictions *convex sets in topological vector spaces *convex sets in 2 dimensions (including convex curves) *convex sets in 3 dimensions (including convex surfaces) *convex sets in ''n'' dimensions (including co ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Sequence
In mathematics, a sequence is an enumerated collection of objects in which repetitions are allowed and order matters. Like a set, it contains members (also called ''elements'', or ''terms''). The number of elements (possibly infinite) is called the ''length'' of the sequence. Unlike a set, the same elements can appear multiple times at different positions in a sequence, and unlike a set, the order does matter. Formally, a sequence can be defined as a function from natural numbers (the positions of elements in the sequence) to the elements at each position. The notion of a sequence can be generalized to an indexed family, defined as a function from an ''arbitrary'' index set. For example, (M, A, R, Y) is a sequence of letters with the letter 'M' first and 'Y' last. This sequence differs from (A, R, M, Y). Also, the sequence (1, 1, 2, 3, 5, 8), which contains the number 1 at two different positions, is a valid sequence. Sequences can be '' finite'', as in these examples, or '' i ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Convex Set
In geometry, a subset of a Euclidean space, or more generally an affine space over the reals, is convex if, given any two points in the subset, the subset contains the whole line segment that joins them. Equivalently, a convex set or a convex region is a subset that intersects every line into a single line segment (possibly empty). For example, a solid cube is a convex set, but anything that is hollow or has an indent, for example, a crescent shape, is not convex. The boundary of a convex set is always a convex curve. The intersection of all the convex sets that contain a given subset of Euclidean space is called the convex hull of . It is the smallest convex set containing . A convex function is a real-valued function defined on an interval with the property that its epigraph (the set of points on or above the graph of the function) is a convex set. Convex minimization is a subfield of optimization that studies the problem of minimizing convex functions over convex ... [...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] |
Hausdorff Metric
In mathematics, the Hausdorff distance, or Hausdorff metric, also called Pompeiu–Hausdorff distance, measures how far two subsets of a metric space are from each other. It turns the set of non-empty compact subsets of a metric space into a metric space in its own right. It is named after Felix Hausdorff and Dimitrie Pompeiu. Informally, two sets are close in the Hausdorff distance if every point of either set is close to some point of the other set. The Hausdorff distance is the longest distance you can be forced to travel by an adversary who chooses a point in one of the two sets, from where you then must travel to the other set. In other words, it is the greatest of all the distances from a point in one set to the closest point in the other set. This distance was first introduced by Hausdorff in his book '' Grundzüge der Mengenlehre'', first published in 1914, although a very close relative appeared in the doctoral thesis of Maurice Fréchet in 1906, in his study of the spac ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Wilhelm Blaschke
Wilhelm Johann Eugen Blaschke (13 September 1885 – 17 March 1962) was an Austrian mathematician working in the fields of differential and integral geometry. Education and career Blaschke was the son of mathematician Josef Blaschke, who taught geometry at the Landes Oberrealschule in Graz. After studying for two years at the Technische Hochschule in Graz, he went to the University of Vienna, and completed a doctorate in 1908 under the supervision of Wilhelm Wirtinger. His dissertation was ''Über eine besondere Art von Kurven vierter Klasse''. After completing his doctorate he spent several years visiting mathematicians at the major universities in Italy and Germany. He spent two years each in positions in Prague, Leipzig, Göttingen, and Tübingen until, in 1919, he took the professorship at the University of Hamburg that he would keep for the rest of his career. His students at Hamburg included Shiing-Shen Chern, Luis Santaló, and Emanuel Sperner. In 1933 Blaschke signe ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Metric Space
In mathematics, a metric space is a set together with a notion of '' distance'' between its elements, usually called points. The distance is measured by a function called a metric or distance function. Metric spaces are the most general setting for studying many of the concepts of mathematical analysis and geometry. The most familiar example of a metric space is 3-dimensional Euclidean space with its usual notion of distance. Other well-known examples are a sphere equipped with the angular distance and the hyperbolic plane. A metric may correspond to a metaphorical, rather than physical, notion of distance: for example, the set of 100-character Unicode strings can be equipped with the Hamming distance, which measures the number of characters that need to be changed to get from one string to another. Since they are very general, metric spaces are a tool used in many different branches of mathematics. Many types of mathematical objects have a natural notion of distance a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Locally Compact
In topology and related branches of mathematics, a topological space is called locally compact if, roughly speaking, each small portion of the space looks like a small portion of a compact space. More precisely, it is a topological space in which every point has a compact neighborhood. In mathematical analysis locally compact spaces that are Hausdorff are of particular interest; they are abbreviated as LCH spaces. Formal definition Let ''X'' be a topological space. Most commonly ''X'' is called locally compact if every point ''x'' of ''X'' has a compact neighbourhood, i.e., there exists an open set ''U'' and a compact set ''K'', such that x\in U\subseteq K. There are other common definitions: They are all equivalent if ''X'' is a Hausdorff space (or preregular). But they are not equivalent in general: :1. every point of ''X'' has a compact neighbourhood. :2. every point of ''X'' has a closed compact neighbourhood. :2′. every point of ''X'' has a relatively compact neighbou ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Compact Set
In mathematics, specifically general topology, compactness is a property that seeks to generalize the notion of a closed and bounded subset of Euclidean space by making precise the idea of a space having no "punctures" or "missing endpoints", i.e. that the space not exclude any ''limiting values'' of points. For example, the open interval (0,1) would not be compact because it excludes the limiting values of 0 and 1, whereas the closed interval ,1would be compact. Similarly, the space of rational numbers \mathbb is not compact, because it has infinitely many "punctures" corresponding to the irrational numbers, and the space of real numbers \mathbb is not compact either, because it excludes the two limiting values +\infty and -\infty. However, the ''extended'' real number line ''would'' be compact, since it contains both infinities. There are many ways to make this heuristic notion precise. These ways usually agree in a metric space, but may not be equivalent in other top ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Isoperimetric Inequality
In mathematics, the isoperimetric inequality is a geometric inequality involving the perimeter of a set and its volume. In n-dimensional space \R^n the inequality lower bounds the surface area or perimeter \operatorname(S) of a set S\subset\R^n by its volume \operatorname(S), :\operatorname(S)\geq n \operatorname(S)^ \, \operatorname(B_1)^, where B_1\subset\R^n is a unit sphere. The equality holds only when S is a sphere in \R^n. On a plane, i.e. when n=2, the isoperimetric inequality relates the square of the circumference of a closed curve and the area of a plane region it encloses. '' Isoperimetric'' literally means "having the same perimeter". Specifically in \R ^2, the isoperimetric inequality states, for the length ''L'' of a closed curve and the area ''A'' of the planar region that it encloses, that : L^2 \ge 4\pi A, and that equality holds if and only if the curve is a circle. The isoperimetric problem is to determine a plane figure of the largest possible area ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Lebesgue's Universal Covering Problem
Lebesgue's universal covering problem is an unsolved problem in geometry that asks for the convex shape of smallest area that can cover every planar set of diameter one. The diameter of a set by definition is the least upper bound of the distances between all pairs of points in the set. A shape covers a set if it contains a congruent subset. In other words the set may be rotated, translated or reflected to fit inside the shape. Formulation and early research The problem was posed by Henri Lebesgue in a letter to Gyula Pál in 1914. It was published in a paper by Pál in 1920 along with Pál's analysis. He showed that a cover for all curves of constant width one is also a cover for all sets of diameter one and that a cover can be constructed by taking a regular hexagon with an inscribed circle of diameter one and removing two corners from the hexagon to give a cover of area 2-\frac\approx 0.84529946. In 1936, Roland Sprague showed that a part of Pál's cover could be removed ne ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
