• Problems and Theorems in Analysis (German: Aufgaben und Lehrsätze aus der Analysis) is a two-volume problem book in analysis by George Pólya and Gábor...
    10 KB (1,338 words) - 01:54, 22 February 2025
  • Thumbnail for Mathematical analysis
    (2 volumes), by Isidor Natanson Problems in Mathematical Analysis, by Boris Demidovich Problems and Theorems in Analysis (2 volumes), by George Pólya, Gábor...
    45 KB (4,391 words) - 07:02, 23 April 2025
  • Thumbnail for George Pólya
    Szegő two influential problem books, Problems and Theorems in Analysis (I: Series, Integral Calculus, Theory of Functions and II: Theory of Functions...
    19 KB (1,804 words) - 09:27, 29 May 2025
  • Thumbnail for Gábor Szegő
    Gábor Szegő (category Washington University in St. Louis mathematicians)
    ISBN 3-7643-3063-5 Pólya, George; Szegő, Gábor (1972) [1925], Problems and Theorems in Analysis, 2 Vols, Springer-Verlag Szegő, Gábor (1933), Asymptotische...
    13 KB (1,197 words) - 05:21, 15 June 2025
  • In the analysis of algorithms, the master theorem for divide-and-conquer recurrences provides an asymptotic analysis for many recurrence relations that...
    16 KB (1,978 words) - 18:28, 27 February 2025
  • Gödel's incompleteness theorems are two theorems of mathematical logic that are concerned with the limits of provability in formal axiomatic theories....
    92 KB (12,173 words) - 17:35, 18 June 2025
  • Cohn's irreducibility criterion (category Theorems in algebra)
    der Analysis, Bd 2. Springer, Berlin. OCLC 73165700. English translation in: Pólya, George; Szegő, Gábor (2004). Problems and theorems in analysis, volume...
    5 KB (694 words) - 07:34, 5 April 2025
  • Raymond Paley (1907–1933) and Norbert Wiener (1894–1964) who, in 1934, introduced various versions of the theorem. The original theorems did not use the language...
    10 KB (1,569 words) - 02:16, 31 May 2025
  • In mathematical analysis, the Hilbert–Schmidt theorem, also known as the eigenfunction expansion theorem, is a fundamental result concerning compact, self-adjoint...
    2 KB (271 words) - 03:54, 30 November 2024
  • The Sokhotski–Plemelj theorem (Polish spelling is Sochocki) is a theorem in complex analysis, which helps in evaluating certain integrals. The real-line...
    7 KB (1,238 words) - 21:31, 25 October 2024
  • automated reasoning and mathematical logic dealing with proving mathematical theorems by computer programs. Automated reasoning over mathematical proof was a...
    29 KB (2,933 words) - 22:11, 19 June 2025
  • Gödel's incompleteness theorems are very similar to those raised by the halting problem, and the proofs are quite similar. In fact, a weaker form of the...
    53 KB (7,350 words) - 09:57, 12 June 2025
  • the mathematical recurrences that appear in the analysis of divide and conquer algorithms where the sub-problems have substantially different sizes. It...
    5 KB (929 words) - 06:48, 16 June 2025
  • Thumbnail for Residue theorem
    In complex analysis, the residue theorem, sometimes called Cauchy's residue theorem, is a powerful tool to evaluate line integrals of analytic functions...
    13 KB (3,290 words) - 09:31, 29 January 2025
  • Thumbnail for Fermat's Last Theorem
    subsequently proven by others and credited as theorems of Fermat (for example, Fermat's theorem on sums of two squares), Fermat's Last Theorem resisted proof, leading...
    104 KB (11,741 words) - 21:37, 19 June 2025
  • Thumbnail for Four color theorem
    still an extremely long case analysis. In 2005, the theorem was verified by Georges Gonthier using a general-purpose theorem-proving software. The coloring...
    49 KB (6,277 words) - 23:39, 14 May 2025
  • program. The theorem generalizes the undecidability of the halting problem. It has far-reaching implications on the feasibility of static analysis of programs...
    12 KB (1,712 words) - 11:17, 18 March 2025
  • Mergelyan's theorem is a result from approximation by polynomials in complex analysis proved by the Armenian mathematician Sergei Mergelyan in 1951. Let...
    4 KB (536 words) - 01:42, 22 January 2025
  • traditional envelope theorems. Paul Milgrom and Ilya Segal (2002) observe that the traditional envelope formula holds for optimization problems with arbitrary...
    25 KB (3,981 words) - 03:07, 20 April 2025
  • This is a list of notable theorems. Lists of theorems and similar statements include: List of algebras List of algorithms List of axioms List of conjectures...
    78 KB (6,289 words) - 12:34, 6 June 2025
  • whether (or in what way) these theorems answer Hilbert's second problem. Simpson (1988) argues that Gödel's incompleteness theorem shows that it is not possible...
    15 KB (1,500 words) - 01:07, 19 March 2024
  • In mathematical logic, the compactness theorem states that a set of first-order sentences has a model if and only if every finite subset of it has a model...
    14 KB (1,946 words) - 02:43, 16 June 2025
  • Superadditivity (category Mathematical analysis)
    University of Cambridge. Notes György Polya and Gábor Szegö. (1976). Problems and theorems in analysis, volume 1. Springer-Verlag, New York. ISBN 0-387-05672-6...
    5 KB (776 words) - 15:41, 24 February 2025
  • through its endpoints. It is one of the most important results in real analysis. This theorem is used to prove statements about a function on an interval...
    28 KB (5,401 words) - 20:28, 19 June 2025
  • for law and other non-technical fields can provide a similar function. George Pólya and Gábor Szegő (1925) Problems and Theorems in Analysis (German:...
    3 KB (369 words) - 10:47, 31 October 2024
  • A083648 in the OEIS) and (sequence A073009 in the OEIS) Pólya, George; Szegő, Gábor (1998), "Part I, problem 160", Problems and Theorems in Analysis, Springer...
    9 KB (1,471 words) - 13:49, 20 April 2025
  • restriction is continuous. Closed graph theorem (functional analysis) – Theorems connecting continuity to closure of graphs Densely defined operator – Function...
    8 KB (1,182 words) - 21:31, 5 April 2025
  • rule in differentiation Sum rule in integration Sylow theorems Transcendence of e and π (as corollaries of Lindemann–Weierstrass) Tychonoff's theorem (to...
    6 KB (593 words) - 20:11, 5 June 2023
  • In discrete mathematics, Schur's theorem is any of several theorems of the mathematician Issai Schur. In differential geometry, Schur's theorem is a theorem...
    6 KB (851 words) - 23:17, 19 June 2025
  • Thumbnail for Cauchy–Riemann equations
    Cauchy–Riemann equations (category Complex analysis)
    and their integrals. Translated by Frances Hardcastle. Cambridge: MacMillan and Bowes. Pólya, George; Szegő, Gábor (1978). Problems and theorems in analysis...
    34 KB (5,011 words) - 14:50, 1 April 2025