小窓モード

プレミアム

ログイン
設定

設定

「Theorem」の共起表現一覧(1語右で並び替え)

該当件数 : 655



Bolzano-Weierstrass theorem, a theorem concerning sequences in real analy
The Steiner-Lehmus theorem, a theorem in elementary geometry, was formul
The Pythagorean Theorem: A 4,000-Year History, 2007, Princeton Univer
We call the set C in Ritt's Theorem a Ritt characteristic set of the ideal .
rization theorems, e.g. the Moore metrization theorem: a collectionwise normal, Moore space is metr
Princeton mathematician, proved the Free will theorem, a startling version of the No Hidden Variabl
Theorem: A group decision function with an odd number
By Steinitz's theorem, a planar graph represents the edges and vert
They first formulated the mean speed theorem: a body moving with constant velocity travels
This article refers to Carmichael's theorem about Fibonacci numbers.
He is known for formulating the CAP Theorem about distributed network applications.
rnack's inequality is used to prove Harnack's theorem about the convergence of sequences of harmoni
In mathematics, Ono's inequality is a theorem about triangles in the Euclidean plane.
In linear algebra, Weyl's inequality is a theorem about the changes to eigenvalues of a Hermiti
roof of the Sato-Tate conjecture uses Wiles's theorem about modularity of semistable elliptic curve
The theorem above, however, would then not be demonstrabl
It is colloquially known as the LSD theorem, after the authors Lloyd, Shor, and Devetak w
ishment is his work on proving the modularity theorem, also known as the Taniyama-Shimura Conjectur
The Berry-Esseen theorem, also known as the Berry-Esseen inequality, a
β(E), Raanan Schul showed Traveling Salesman Theorem also holds for sets E that lie in any Hilbert
d expectations, the tower rule, the smoothing theorem, among other names, states that if X is an in
ains the proof of the fluctuation-dissipation theorem, an extremely general result describing how a
rk on foraging, especially the marginal value theorem, and life history theory, especially sex allo
quantum analog of Shannon's noiseless coding theorem, and it helped to start the field known as qu
des are refinable, because of the convolution theorem and the refinability of the characteristic fu
ctures: the Riemann hypothesis, Fermat's Last Theorem, and the transcendence of 2√2.
e such an inequality invoked the Hawking area theorem and the Cosmic censorship hypothesis.
ble within finite time and memory (see Rice's theorem and the halting problem).
on perfect powers, such as the Goldbach-Euler theorem, and made several notable contributions to an
When a theorem and its reciprocal are true we say that its h
Emile Bachelet applied Earnshaw's theorem and the Braunbeck extension and stabilized ma
s known for his new proof of the prime number theorem and for the many solutions he provided to pro
He proved Fitting's theorem and Fitting's lemma, and defined the Fitting
dwidth in the context of for example sampling theorem and Nyquist sampling rate, while it refers to
relativity, black holes, the positive energy theorem and cosmology.
etween p + 1 − 2√p and p + 1 + 2√p by Hasse's theorem, and is likely to be smooth for some elliptic
with dominos; this result is called Gomory's theorem, and is named after mathematician Ralph E. Go
ued fraction of x plays no role in Khinchin's theorem and since the rational numbers have Lebesgue
he matrix are orthogonal (due to the spectral theorem) and represent the directions of the axes of
quence of the combination of the prime number theorem and the limit of the Euler-Mascheroni constan
It is closely related to Myers' theorem, and the key point in the proof of Gromov's c
See Sion's minimax theorem and Parthasarathy's theorem for generalizatio
The proof of Hoeffding's lemma uses Taylor's theorem and Jensen's inequality.
It has "no hairs" (No hair theorem) and is fully characterized by ADM-mass, angu
It is a generalization of the marriage theorem and is a special case of the Tutte-Berge form
the computational core of the incompleteness theorem, and were able to produce undecidable problem
e first proof of what is now known as Euler's theorem and constructs the logarithmic spiral.
are interesting because of the Bourbaki-Witt theorem, and their connection with Zorn's lemma.
t at a point (this can be proved using Ceva's theorem), and this point is called the isotomic conju
what is now known as the Nielsen fixed point theorem: Any map f has at least N(f) fixed points.
From the Pythagorean theorem applied to the two right-angled triangles, on
Stokes showed in 1849 that the theorem applied to any law of density so long as the
from the application of Bartlett's bisection theorem applied to the first T-section in each networ
A more general version of the theorem applies to list coloring: given any connected
e conditions stated in the Bruck-Ryser-Chowla theorem are not merely necessary, but also sufficient
Proofs of this theorem are given by , and more recently by .
factors p1, p2, ... By the Chinese remainder theorem, arithmetic modulo N corresponds to arithmeti
and extended the treatment of the Pythagorean theorem as first presented in 800 BC by Baudhayana.
classes of toric varieties, the Riemann-Roch theorem as well as Fourier analysis have been used fo
ians and scientists sometimes use beauty of a theorem as an indication for its truth, an idea that
rimarily associated with the Hellmann-Feynman theorem, as well as with one of the first-ever textbo
mally, we can state the Transfinite Recursion Theorem as follows.
A third way is to treat Kunen's theorem as a countable infinite collection of theorem
In absolute geometry, the Saccheri-Legendre theorem asserts that the sum of the angles in a trian
illustration of the Four-vertex theorem at an ellipse
ho has anything new to say about the binomial theorem at this late date?
drew Wiles announces a proof of Fermat's Last Theorem at the Isaac Newton Institute.
Contrary to the classical equipartition theorem, at room temperature, the vibrational motion
The theorem became a rather popular topic in elementary g
ay be considered a possible "loophole" of the theorem because it contains additional generators (su
diameter with speed according to Bernoulli's theorem but remained largely incompressible and actin
This mimics the GRR theorem; but f! has only an implicit definition.
her similar statement is the Paris-Harrington theorem, but Friedman's finite form of Kruskal's theo
We prove the finite case of Hall's marriage theorem by induction on , the size of S. The infinite
and all of them imply the (usual) four-vertex theorem by a limit argument.
ntributed to the solution of the prime number theorem by providing rigorous proofs of two statement
A theorem by Gallai and Milgram shows that the number o
more elementary particles, usually fermions.A theorem by Steven Weinberg and Edward Witten shows th
The exterior angle theorem can mean one of two things: Postulate 1.16 in
led Jordan polygons, because the Jordan curve theorem can be used to prove that such a polygon divi
x is sampled, the universal prior and Bayes' theorem can be used to predict the yet unseen parts o
ics, particularly general relativity, Price's theorem can be informally stated as the principle tha
A construction based on the planar separator theorem can be used to show that n-vertex planar grap
Gomory's theorem can be proven using a Hamiltonian cycle of th
Miller's theorem can be used to effect this replacement.
This theorem can be generalized to any metric space.
The theorem can be generalized to higher dimensional simp
The theorem can be extended to equilateral polygons and e
The theorem can be generalized from Fibonacci numbers to
The theorem can also be proved using ultrafilters or non-
The no-ghost theorem can be used to construct some generalized Kac
This version of the theorem can be proved with the tools of ordinary calc
Thales' theorem can be used to construct the tangent to a giv
xample of how Kempe's proof of the four color theorem cannot work.
The theorem cannot be generalized to all nonplanar triang
or such concepts as Carnot efficiency, Carnot theorem, Carnot heat engine, and others.
years, this relation became known as Eggan's theorem, cf. .
many forbidden minors analogously to Wagner's theorem characterizing the planar graphs.
n program: for example, the Gorenstein-Walter theorem, classifying finite groups with a dihedral Sy
sed on an equilateral triangle, and Viviani's theorem concerning any point within the triangle, and
"On the Luttinger theorem concerning number of particles in the ground
n the context of electromagnetism, Birkhoff's theorem concerns spherically symmetric static solutio
While the Ehlers-Geren-Sachs theorem concerns only exactly isotropic measurements,
Specifically, Noether's theorem connects some conservation laws to certain sy
circulation (and hence by the Kutta-Joukowski theorem constant lift) at all sections on the wingspa
so the theorem could otherwise be stated in terms of the map
work at the subject that a good mathematical theorem dealing with economic hypothesis was very unl
nts, construction of K-sets, the ham sandwich theorem, Delaunay triangulation, point location, inte
In Ramsey theory, the Rado-Folkman-Sanders theorem describes "partition regular" sets.
In geometry, Routh's theorem determines the ratio of areas between a given
A. Diamond of the Diamond-Mirrlees Efficiency Theorem, developed in 1971.
In brief, then, the Hairy Ball Theorem dictates that, given at least some wind on Ea
In other words, the Oseledets theorem differs from additive ergodic theorems (such
Earnshaw's theorem does not apply to diamagnets.
However, the Garden of Eden theorem does not characterize the existence of such p
The structured program theorem does not address how to write and analyze a u
tale's random Brunn-Minkowski inequality is a theorem due to Richard Vitale that generalizes the cl
ical logic, the diagonal lemma or fixed point theorem establishes the existence of self-referential
The proof of the Brunn-Minkowski theorem establishes that the function
By Brooks' theorem, every k-regular graph (except for odd cycles
By the Fermat polygonal number theorem, every number is the sum of at most 12 dodeca
Chen Jingrun publishes Chen's theorem: every sufficiently large even number can be
Oriani's theorem explains why Cassini's uniform-density model
have a mixed state, the cluster decomposition theorem fails.
er to do so, he uses, unknowingly, the ballot theorem, first proved by W.A. Whitworth in 1887.
ly one vertex from each path in P. Dilworth's theorem follows as a corollary of this result.
ith only four directions, then the four color theorem follows.
Using the monotone convergence theorem for the first equality, then the last inequal
obabilistic version of Fatou's boundary limit theorem for harmonic functions.
Duhamel's theorem for infinitesimals says that the sum of a ser
his work with Vickers on the positive energy theorem for Bondi mass.
An extension of the theorem for the Bondi mass was given by Ludvigsen and
The original proof of the theorem for ADM mass was provided by Richard Schoen a
By the already-proven case of the theorem for S' we see that we can indeed pick an SDR
their first important results was a structure theorem for Donaldson's polynomial invariants and app
B. V. Singbal proved the theorem for the more general case where K may be non-
earlier results in this area is an extension theorem for completely positive maps with values in t
ive statement of the Nyquist-Shannon sampling theorem for components of diffracted intensity.
les of finite length; there is also analogous theorem for coherent sheaves when the algebra is Noet
The corresponding theorem for supersymmetric theories with a mass gap i
Nussbaum, A. Edward, A Commutativity Theorem for Semi-Bounded Operators in Hilbert Space
"The Strength of the Sikorski Extension Theorem for Boolean Algebras", Journal of Symbolic Lo
ositions Equivalent to the Sikorski Extension Theorem for Boolean Algebras", Fundamenta Mathematica
rdered topologies: Priestley's representation theorem for distributive lattices.
to CohSp - one obtains Stone's representation theorem for distributive lattices.
contributions to this area is a decomposition theorem for analyzing Markov chains.
this area such as the biholomorphic embedding theorem for a Stein manifold as a closed submanifold
-Olesen Vortex and the Nielsen-Ninomiya no-go theorem for representing chiral fermions on the latti
iety Golden Jubilee Paper Award for "A Useful Theorem for nonlinear devices having Gaussian inputs"
In 1934, Tychonoff proved the theorem for the case when K is a compact convex subse
In 1946 he proved the unmixedness theorem for power series rings, as a result of which
utions to the theory of polyhedra: Steinitz's theorem for polyhedra is that the 1-skeletons of conv
Geometric proof of the Pythagorean theorem from the Zhou Bi Suan Jing
the pentecontad calendar with the Pythagorean theorem, further describing the number fifty as the "
Helly's theorem gave rise to the notion of a Helly family.
Viviani's theorem generalizes to equilateral polygons.
Schnyder's theorem gives a characterization of planarity in term
The Bruck-Ryser-Chowla theorem gives necessary but not sufficient conditions
This example will show how using Topkis's Theorem gives the same result as using more standard
n algebraic combinatorics, the Kruskal-Katona theorem gives a complete characterization of the f-ve
ory, a part of discrete mathematics, the BEST theorem gives a product formula for the number of Eul
In information theory, Sanov's theorem gives a bound on the probability of observing
eory, the Heawood conjecture or Ringel-Youngs theorem gives an upper bound for the number of colors
In physics, the cluster decomposition theorem guarantees locality in quantum field theory.
Savitch's theorem guarantees that the algorithm can be simulate
The Bourbaki-Witt theorem has various important applications.
ed from a fence via Birkhoff's representation theorem, has as its graph the Fibonacci cube.
Concepts related to Radon's theorem have also been considered for convex geometri
Several versions of the theorem have been proved that more precisely characte
In this, as with the above-mentioned sampling theorem, he and Claude Shannon in the US reached the
d Roger Lyndon; in his 1969 paper stating the theorem, Hedlund credited Curtis and Lyndon as co-dis
much the same reason that the infinite monkey theorem holds: there is some probability of getting t
proof is similar to the proof of the original theorem, however the properties of the dyadic cubes r
According to Marden's theorem, if the three vertices of the triangle are th
Theorem: If a planar graph has minimum degree 5, then
Theorem: If Z ≥ 0 is a random variable with finite va
Edgar's theorem implies Lindenstrauss's theorem.
This theorem implies the formal equivalence between expect
losed under minors, and the Robertson-Seymour theorem implies that pseudoforests can be characteriz
Green's function using wave field reciprocity theorem in a lossless, 3D heterogeneous medium.
of schemes has led to the Artin approximation theorem, in local algebra.
Gelfond proved a special case of the theorem in 1929, when he was a postgraduate student a
Edward Mills Purcell stated this theorem in his 1977 paper Life at Low Reynolds Number
Alexander's theorem in braid theory states that the converse is t
In the same year, he proved the CPT theorem in the particular form that for a relativisti
His paper On time average theorem in dynamics, which appeared in the Proceeding
The central limit theorem in probability theory and statistics states t
so known as the majorization inequality, is a theorem in elementary algebra for convex and concave
but strictly speaking the classification is a theorem in pure mathematics applying to any Lorentzia
ors, so the conjecture follows from the snark theorem in this case.
iant K-theory and the Atiyah-Segal completion theorem in that subject was a major motivation for th
Parikh's theorem in theoretical computer science says that if
es a case analysis involving the Jordan curve theorem, in which one examines different possibilitie
e can reformulate a special case of Hindman's Theorem in more familiar terms: Suppose the natural n
mitments; extensions of Arrow's Impossibility Theorem in social choice; competitive service speed i
Darboux's theorem in real analysis, related to Intermediate val
                                                                                                   


こんにちは ゲスト さん

ログイン

Weblio会員(無料)になると

会員登録のメリット検索履歴を保存できる!

会員登録のメリット語彙力診断の実施回数増加!

無料会員に登録する
英→日 日→英
こんにちは ゲスト さん

ログイン

Weblio会員(無料)になると

会員登録のメリット検索履歴を保存できる!

会員登録のメリット語彙力診断の実施回数増加!

無料会員に登録する

©2026 GRAS Group, Inc.RSS