Search results

...al hierarchy]]); these theorems are studied as part of [[hyperarithmetical theory]]. ...ow that there must be points that are not "too far" from being computable, in an informal sense. ...

In mathematics, specifically in the study of [[vector bundle]]s over [[Kähler manifold|complex Kähler manif ...first2=Shigeo|date=1954|title=Note on Kodaira-Spencer's proof of Lefschetz theorems|url=https://projecteuclid.org/euclid.pja/1195526105|journal=Proceedings of ...

...s theorem on differentiation''', named after [[Guido Fubini]], is a result in [[real analysis]] concerning the [[Derivative|differentiation]] of series o ...th> is an [[interval (mathematics)|interval]] and that for every [[natural number]] ''k'', <math>f_k: I \to \mathbb R</math> is an [[increasing function]]. I ...

...Bernays]], are a set of requirements for formalized provability predicates in formal theories of arithmetic (Smith 2007:224). These conditions are used in many proofs of [[Kurt Gödel]]'s [[Gödel's second incompleteness theorem|sec ...

....}}</ref> The theorems are among the most important results of [[invariant theory]]. ...bitrary characteristic.<ref>{{harvnb|Procesi|2007|loc=Ch. 13 develops this theory.}}</ref> ...

...t of many (possibly dependent) events occurs. The lower bound is expressed in terms of the probabilities for pairs of events. ...). It can be obtained by applying the [[Paley–Zygmund inequality]] to the number of <math>A_i</math> which occur. ...

{{about|the area in computer science|the area in applied mathematics|Structural complexity (applied mathematics)}} ...Automata, Languages and Programming]], 1988 (ICALP 88), ''[[Lecture Notes in Computer Science]]'', vol. 317 (1988), pp. 271-286.</ref> ...

...istributed equally across possible progressions with the same difference. Theorems of the Barban–Davenport–Halberstam type give estimates for the error term, be a weighted count of primes in the arithmetic progression ''a''&nbsp;mod&nbsp;''q''. We have ...

...in many important cases (see Examples), and (c) the former theorem is used in the proof of the latter theorem. ...th>h : X \to Y </math> out of <math>f</math> and <math>g</math> exactly as in the [[Cantor–Bernstein–Schroeder theorem|proof of the Cantor–Bernstein–Schr ...

...main theorems in [[local class field theory]] states that the norm groups in <math>K^\times</math> are precisely the open subgroups of <math>K^\times</m *J.S. Milne, ''Class field theory.'' Version 4.01. ...

...by [[Joseph O'Rourke (professor)|Joseph O'Rourke]], and published in 1987 in the International Series of Monographs on Computer Science of the [[Oxford The [[art gallery problem]], posed by [[Victor Klee]] in 1973, asks for the number of points at which to place guards inside a polygon (representing the floor ...

{{short description|Type of theorem in automorphic forms}} In the mathematical theory of [[automorphic form]]s, a '''converse theorem''' gives sufficient conditi ...

...m has been used to describe these relationships because they can be proved in terms of more elementary concepts. The operational proofs<ref name="kacser1 }}</ref> in particular are of this nature. ...

...non-reduced [[affine root system]]. It is related to Euler's [[pentagonal number theorem]]. = \sum_{n\in \mathbf{Z}}s^{(3n^2+n)/2}(t^{3n}-t^{-3n-1}) </math> ...

...ization]] in the full quantum theory. Renormalization theorems are common in theories with a sufficient amount of [[supersymmetry]], usually at least 4 ...ntroduced by [[Marcus T. Grisaru]], [[Martin Rocek]] and [[Warren Siegel]] in their 1979 paper [http://www.slac.stanford.edu/spires/find/hep/www?j=NUPHA, ...

...lm Wirtinger]] in 1932 in connection with some problems of [[approximation theory]]. This theorem gives the representation formula for the [[Holomorphic func }}</ref> contains the following theorem presented also in [[Joseph L. Walsh]]'s well-known monograph ...

...extension theorem''' is a result from [[measure theory]] and [[probability theory]] on extensions of [[probability measure]]s. The theorem makes a statement ...principles for extending probability measures |journal=Manuscripta Math. |number=21 |pages=43–50 |date=1977|volume=21 |doi=10.1007/BF01176900 }}</ref> ...

...ing finite sets of relations; however, the Max/min CSP/Ones classification theorems give information about the complexity of [[approximation algorithm|approxim ...ll clauses are satisfied, and the ''Min Ones problem'' is to minimize this number.<ref>{{cite web|first1=Erik|last1=Demaine|date=Fall 2014|title=Algorithmic ...

In [[mathematics]], '''Kronecker's congruence''', introduced by [[Leopold Kron ...Verlag]] | location=Berlin, New York | edition=2nd | series=Graduate Texts in Mathematics | isbn=978-0-387-96508-6 |mr=890960 | year=1987 | volume=112}} ...

...olutely continuous distributions with respect to the [[Lebesgue measure]] (in other words, one of the players is forbidden to use a [[pure strategy]]). ...phi_k(x)</math> are continuous functions. For <math> \mu \in M_X, \lambda \in M_Y</math>, define ...