Borel graph theorem is generalization of the closed graph theorem that was proven by L. Schwartz. The Borel graph theorem shows that the closed graph...
3 KB (482 words) - 21:20, 20 April 2023
closed graph theorem is a result connecting the continuity of a linear operator to a topological property of their graph. Precisely, the theorem states...
15 KB (2,719 words) - 23:53, 19 February 2025
Borel spaces and f : X → Y {\displaystyle f:X\to Y} then f {\displaystyle f} is measurable if and only if the graph of f {\displaystyle f} is Borel....
3 KB (423 words) - 07:18, 27 May 2024
Law of large numbers (redirect from Borel's law of large numbers)
also contributed to refinement of the law, including Chebyshev, Markov, Borel, Cantelli, Kolmogorov and Khinchin. Markov showed that the law can apply...
45 KB (6,384 words) - 15:12, 17 June 2025
as the De Bruijn–Erdős theorem stating that every minimal k-chromatic graph is finite, and the Curtis–Hedlund–Lyndon theorem providing a topological...
15 KB (2,102 words) - 06:46, 13 December 2024
Ax–Grothendieck theorem (model theory) Barwise compactness theorem (mathematical logic) Borel determinacy theorem (set theory) Büchi-Elgot-Trakhtenbrot theorem (mathematical...
78 KB (6,289 words) - 12:34, 6 June 2025
fixed-point theorem Banach fixed-point theorem Bekić's theorem Borel fixed-point theorem Bourbaki–Witt theorem Browder fixed-point theorem Brouwer fixed-point...
11 KB (1,278 words) - 00:51, 3 February 2024
In probability theory, de Finetti's theorem states that exchangeable observations are conditionally independent relative to some latent variable. An epistemic...
18 KB (2,571 words) - 11:09, 17 April 2025
Lusin's separation theorem (descriptive set theory) states that for any two disjoint analytic subsets of a Polish space there is a Borel subset containing...
2 KB (258 words) - 10:10, 11 July 2024
Graphon (redirect from Borel graph)
random graph is unchanged by a relabeling of its vertices: that is, the labels of the vertices carry no information. There is a representation theorem for...
33 KB (5,460 words) - 19:20, 21 February 2025
bijective or surjective. The theorem has several "real world" illustrations. Here are some examples. Take two sheets of graph paper of equal size with coordinate...
61 KB (8,516 words) - 14:55, 14 June 2025
Ryll-Nardzewski measurable selection theorem says that if X is a Polish space and B {\displaystyle {\mathcal {B}}} its Borel σ-algebra, C l ( X ) {\displaystyle...
7 KB (920 words) - 22:38, 30 May 2024
Lebesgue–Vitali theorem Blaschke–Lebesgue theorem Borel–Lebesgue theorem Fatou–Lebesgue theorem Riemann–Lebesgue lemma Walsh–Lebesgue theorem Dominated convergence...
19 KB (2,242 words) - 20:29, 1 June 2025
then any Borel homomorphism from G to H is continuous. Secondly, there is a version of the open mapping theorem or the closed graph theorem due to Kuratowski:...
12 KB (1,509 words) - 21:41, 29 May 2025
(Avraham Trahtman, 2007) Robertson–Seymour theorem (Neil Robertson, Paul Seymour, 2004) Strong perfect graph conjecture (Maria Chudnovsky, Neil Robertson...
195 KB (20,069 words) - 07:07, 11 June 2025
Genus (mathematics) (category Graph invariants)
of orientable surfaces Planar graph: genus 0 Toroidal graph: genus 1 Teapot: Double Toroidal graph: genus 2 Pretzel graph: genus 3 The non-orientable genus...
10 KB (1,412 words) - 15:03, 2 May 2025
Fourier series (redirect from Fourier theorem)
{\displaystyle F\in BV} defines a Radon measure (i.e. a locally finite Borel measure on R {\displaystyle \mathbb {R} } ), this definition can be extended...
72 KB (11,152 words) - 11:43, 12 June 2025
List of mathematical proofs (section Theorems of which articles are primarily devoted to proving them)
theorem Goodstein's theorem Green's theorem (to do) Green's theorem when D is a simple region Heine–Borel theorem Intermediate value theorem Itô's lemma Kőnig's...
6 KB (593 words) - 20:11, 5 June 2023
covolume. The terminology introduced above is coherent with this, as a theorem due to Borel and Harish-Chandra states that an arithmetic subgroup in a semisimple...
22 KB (3,301 words) - 18:32, 23 May 2025
commonly written as ln(x) or loge(x). In mathematics, the prime number theorem (PNT) describes the asymptotic distribution of the prime numbers among...
66 KB (9,149 words) - 07:59, 2 June 2025
X\times Y} is a countable Borel relation. If f : X → Y {\displaystyle f:X\to Y} is a function between standard Borel spaces, the graph Γ ( f ) {\displaystyle...
11 KB (1,818 words) - 23:43, 10 December 2024
Isoperimetric inequality (redirect from Isoperimetric theorem)
Blaschke–Lebesgue theorem Chaplygin problem: isoperimetric problem is a zero wind speed case of Chaplygin problem Curve-shortening flow Expander graph Gaussian...
24 KB (3,479 words) - 14:55, 12 May 2025
Equivalence relation (redirect from Graphing equivalence)
class is the natural number n. Borel equivalence relation Cluster graph – Graph made from disjoint union of complete graphs Conjugacy class – In group theory...
31 KB (4,473 words) - 10:22, 23 May 2025
Laplace transform (section Borel transform)
functions not of exponential type. Nachbin's theorem gives necessary and sufficient conditions for the Borel transform to be well defined. Since an ordinary...
75 KB (9,447 words) - 10:57, 15 June 2025
Calculus (section Fundamental theorem)
curves. These two branches are related to each other by the fundamental theorem of calculus. They make use of the fundamental notions of convergence of...
76 KB (8,805 words) - 06:25, 7 June 2025
Algebraic topology (section Important theorems)
any free group G may be realized as the fundamental group of a graph X. The main theorem on covering spaces tells us that every subgroup H of G is the...
19 KB (2,093 words) - 21:19, 12 June 2025
is a field of study that discovers and organizes methods, theories and theorems that are developed and proved for the needs of empirical sciences and mathematics...
163 KB (15,943 words) - 18:43, 9 June 2025
variable can be regarded, in the simplest case, as the area between the graph of that function and the X axis. The Lebesgue integral, named after French...
41 KB (5,918 words) - 20:43, 16 May 2025
Finite subdivision rule (redirect from Combinatorial Riemann Mapping Theorem)
hypercubes get divided by every midplane), as in the proof of the Heine–Borel theorem. A finite subdivision rule R {\displaystyle R} consists of the following...
21 KB (2,724 words) - 15:05, 5 June 2024
Discrete geometry (section Geometric graph theory)
polytope, unit disk graphs, and visibility graphs. Topics in this area include: Graph drawing Polyhedral graphs Random geometric graphs Voronoi diagrams...
15 KB (1,575 words) - 05:36, 16 October 2024