enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Metamath - Wikipedia

    en.wikipedia.org/wiki/Metamath

    Metamath is a formal language and an associated computer program (a proof assistant) for archiving and verifying mathematical proofs. [2] Several databases of proved theorems have been developed using Metamath covering standard results in logic, set theory, number theory, algebra, topology and analysis, among others.

  3. Lewy's example - Wikipedia

    en.wikipedia.org/wiki/Lewy's_example

    In the mathematical study of partial differential equations, Lewy's example is a celebrated example, due to Hans Lewy, of a linear partial differential equation with no solutions. It shows that the analog of the Cauchy–Kovalevskaya theorem does not hold in the smooth category.

  4. List of theorems - Wikipedia

    en.wikipedia.org/wiki/List_of_theorems

    Fuchs's theorem (differential equations) Fuglede's theorem (functional analysis) Full employment theorem (theoretical computer science) Fulton–Hansen connectedness theorem (algebraic geometry) Fundamental theorem of algebra (complex analysis) Fundamental theorem of arbitrage-free pricing (financial mathematics)

  5. J. V. Uspensky - Wikipedia

    en.wikipedia.org/wiki/J._V._Uspensky

    James Victor Uspensky (Russian: Яков Викторович Успенский, romanized: Yakov Viktorovich Uspensky; April 29, 1883 – January 27, 1947) was a Russian and American mathematician notable for writing Theory of Equations. [2] [3]

  6. Nachbin's theorem - Wikipedia

    en.wikipedia.org/wiki/Nachbin's_theorem

    In mathematics, in the area of complex analysis, Nachbin's theorem (named after Leopoldo Nachbin) is a result used to establish bounds on the growth rates for analytic functions. In particular, Nachbin's theorem may be used to give the domain of convergence of the generalized Borel transform , also called Nachbin summation .

  7. Erdős conjecture on arithmetic progressions - Wikipedia

    en.wikipedia.org/wiki/Erdős_conjecture_on...

    Because the sum of the reciprocals of the primes diverges, the Green–Tao theorem on arithmetic progressions is a special case of the conjecture. The weaker claim that A must contain infinitely many arithmetic progressions of length 3 is a consequence of an improved bound in Roth's theorem. A 2016 paper by Bloom [4] proved that if {,..

  8. Nielsen–Schreier theorem - Wikipedia

    en.wikipedia.org/wiki/Nielsen–Schreier_theorem

    The free group G = π 1 (X) has n = 2 generators corresponding to loops a,b from the base point P in X.The subgroup H of even-length words, with index e = [G : H] = 2, corresponds to the covering graph Y with two vertices corresponding to the cosets H and H' = aH = bH = a −1 H = b − 1 H, and two lifted edges for each of the original loop-edges a,b.

  9. Schauder estimates - Wikipedia

    en.wikipedia.org/wiki/Schauder_estimates

    In mathematics, and more precisely, in functional Analysis and PDEs, the Schauder estimates are a collection of results due to Juliusz Schauder (1934, 1937) concerning the regularity of solutions to linear, uniformly elliptic partial differential equations.