[permalink] [id link]
** The theorem that every Hilbert space has an orthonormal basis.
from
Wikipedia
Some Related Sentences
** and theorem
** Tarski's theorem: For every infinite set A, there is a bijective map between the sets A and A × A.
** König's theorem: Colloquially, the sum of a sequence of cardinals is strictly less than the product of a sequence of larger cardinals.
** If S is a set of sentences of first-order logic and B is a consistent subset of S, then B is included in a set that is maximal among consistent subsets of S. The special case where S is the set of all first-order sentences in a given signature is weaker, equivalent to the Boolean prime ideal theorem ; see the section " Weaker forms " below.
** The Vitali theorem on the existence of non-measurable sets which states that there is a subset of the real numbers that is not Lebesgue measurable.
** The Baire category theorem about complete metric spaces, and its consequences, such as the open mapping theorem and the closed graph theorem.
** Gödel's completeness theorem for first-order logic: every consistent set of first-order sentences has a completion.
** The numbers and are not algebraic numbers ( see the Lindemann – Weierstrass theorem ); hence they are transcendental.
** More generally, Rademacher's theorem extends the differentiability result to Lipschitz mappings between Euclidean spaces: a Lipschitz map ƒ: U → R < sup > m </ sup >, where U is an open set in R < sup > n </ sup >, is almost everywhere differentiable.
** Artin reciprocity law, a general theorem in number theory that provided a partial solution to Hilbert's ninth problem
** and every
** Zorn's lemma: Every non-empty partially ordered set in which every chain ( i. e. totally ordered subset ) has an upper bound contains at least one maximal element.
** Hausdorff maximal principle: In any partially ordered set, every totally ordered subset is contained in a maximal totally ordered subset.
** The microcode can employ both pipelines to enable auto-repeating instructions such as rep movsw perform one iteration every clock cycle, while the 80486 needed three clocks per iteration ( and the earliest x86-chips significantly more than the 486 ).
** United Kingdom Census held, the first to record names and approximate ages of every household member and to be administered nationally.
** Circuit analysis, the process of finding the voltages across, and the currents through, every component in an electrical circuit
** Unique factorization domain, an integral domain in which every non-zero element can be written as a product of irreducible elements in essentially a unique way
** Atomic domain, an integral domain in which every non-zero non-unit is a finite product of irreducible elements
** Dedekind domain, an integral domain in which every nonzero proper ideal factors into a product of prime ideals
** GCD domain, an integral domain in which every two non-zero elements have a greatest common divisor
0.713 seconds.