maximal theorem
Смотреть что такое "maximal theorem" в других словарях:
Maximal function — Maximal functions appear in many forms in harmonic analysis (an area of mathematics). One of the most important of these is the Hardy–Littlewood maximal function. They play an important role in understanding, for example, the differentiability… … Wikipedia
Maximal ergodic theorem — The maximal ergodic theorem is a theorem in ergodic theory, a discipline within mathematics. Suppose that is a probability space, that is a (possibly noninvertible) measure preserving transformation, and that . Define f * by The … Wikipedia
Maximal ideal — In mathematics, more specifically in ring theory, a maximal ideal is an ideal which is maximal (with respect to set inclusion) amongst all proper ideals.[1][2] In other words, I is a maximal ideal of a ring R if I is an ideal of R, I ≠ R, and… … Wikipedia
Maximal compact subgroup — In mathematics, a maximal compact subgroup K of a topological group G is a subgroup K that is a compact space, in the subspace topology, and maximal amongst such subgroups. Maximal compact subgroups play an important role in the classification of … Wikipedia
Maximal subgroup — Lattice of subgroups of the symmetric group S4 M. s. are A4, three Dih4 and four S3 (Compare: Subgroups of S … Wikipedia
Boolean prime ideal theorem — In mathematics, a prime ideal theorem guarantees the existence of certain types of subsets in a given abstract algebra. A common example is the Boolean prime ideal theorem, which states that ideals in a Boolean algebra can be extended to prime… … Wikipedia
Perron–Frobenius theorem — In linear algebra, the Perron–Frobenius theorem, proved by Oskar Perron (1907) and Georg Frobenius (1912), asserts that a real square matrix with positive entries has a unique largest real eigenvalue and that the corresponding… … Wikipedia
Feit–Thompson theorem — In mathematics, the Feit–Thompson theorem, or odd order theorem, states that every finite group of odd order is solvable. It was proved by Walter Feit and John Griggs Thompson (1962, 1963) Contents 1 History 2 Significance of the proof … Wikipedia
Arrow's impossibility theorem — In social choice theory, Arrow’s impossibility theorem, the General Possibility Theorem, or Arrow’s paradox, states that, when voters have three or more distinct alternatives (options), no voting system can convert the ranked preferences of… … Wikipedia
Dilworth's theorem — In mathematics, in the areas of order theory and combinatorics, Dilworth s theorem characterizes the width of any finite partially ordered set in terms of a partition of the order into a minimum number of chains. It is named for the mathematician … Wikipedia
König's theorem (graph theory) — In the mathematical area of graph theory, König s theorem describes an equivalence between the maximum matching problem and the minimum vertex cover problem in bipartite graphs. Setting A graph is bipartite if its vertices can be partitioned into … Wikipedia
