Informally, the theorem says that the curvature of a surface can be determined entirely by measuring angles and distances on the surface.

Informally speaking, the prime number theorem states that if a random integer is selected in the range of zero to some large integer N, the probability that the selected integer is prime is about 1 / ln ( N ), where ln ( N ) is the natural logarithm of N. For example, among the positive integers up to and including N = 10 < sup > 3 </ sup > about one in seven numbers is prime, whereas up to and including N = 10 < sup > 10 </ sup > about one in 23 numbers is prime ( where ln ( 10 < sup > 3 </ sup >)= 6. 90775528. and ln ( 10 < sup > 10 </ sup >)= 23. 0258509 ).

Informally, a soundness theorem for a deductive system expresses that all provable sentences are true.

Informally, the theorem says that the curvature of a surface can be determined entirely by measuring distances along paths on the surface.

Informally, the theorem states that arithmetical truth cannot be defined in arithmetic.

Informally, the theorem says that given some formal arithmetic, the concept of truth in that arithmetic is not definable using the expressive means that arithmetic affords.

# From conclude: Informally, this says that if A is a theorem, then it is provable.

Informally put, the idea behind the proof of the no-trade theorem is that if there is common knowledge about the structure of a market, then any bid or offer ( i. e. attempt to initiate a trade ) will reveal the bidder's private knowledge and will be incorporated into market prices even before anyone accepts the bid or offer, so no profit will result.

Informally put, the axiom of choice says that given any collection of bins, each containing at least one object, it is possible to make a selection of exactly one object from each bin.

Informally, it is a permutation of the group elements such that the structure remains unchanged.

Informally, it is the similarity between observations as a function of the time separation between them.

Informally, this is true because polynomial time algorithms are closed under composition.

Informally, an object is reachable if it is referenced by at least one variable in the program, either directly or through references from other reachable objects.

Informally, a relational database table is often described as " normalized " if it is in the Third Normal Form.

Informally, a graph is a good expander if it has low degree and high expansion parameters.

Informally, Kajang is known as the " Satay Town ", and is famous among tourists and locals alike.

Informally we can think of elements of the Lie algebra as elements of the group that are " infinitesimally close " to the identity, and the Lie bracket is something to do with the commutator of two such infinitesimal elements.

Informally, a measure has the property of being monotone function | monotone in the sense that if A is a subset of B, the measure of A is less than or equal to the measure of B.

Informally, word formation rules form " new words " ( that is, new lexemes ), while inflection rules yield variant forms of the " same " word ( lexeme ).

Informally, he may have been known as " Dickon ", according to a sixteenth-century legend of a note, warning of treachery, that was sent to the Duke of Norfolk on the eve of Bosworth: " Jack of Norffolke be not to bolde ,/ For Dyckon thy maister is bought and solde ".

Informally the word is also used to describe a procedure or process with a specific purpose.

Informally, a permutation of a set of objects is an arrangement of those objects into a particular order.

Informally, a set of strategies is a Nash equilibrium if no player can do better by unilaterally changing his or her strategy.

Where Marcinkiewicz's theorem is weaker than the Riesz-Thorin theorem is in the estimates of the norm.

Hence Marcinkiewicz's theorem shows that it is bounded from to for any 1 < p < 2.

Later realized that Marcinkiewicz's result could greatly simplify his work, at which time he published his former student's theorem together with a generalization of his own.

The theorem which we prove is more general than what we have described, since it works with the primary decomposition of the minimal polynomial, whether or not the primes which enter are all of first degree.

In the primary decomposition theorem, it is not necessary that the vector space V be finite dimensional, nor is it necessary for parts ( A ) and ( B ) that P be the minimal polynomial for T.

This theorem is similar to the theorem of Kakutani that there exists a circumscribing cube around any closed, bounded convex set in Af.

According to Cauchy's functional equation theorem, the logarithm is the only continuous transformation that transforms real multiplication to addition.

One motivation for this use is that a number of generally accepted mathematical results, such as Tychonoff's theorem, require the axiom of choice for their proofs.

However, that particular case is a theorem of Zermelo – Fraenkel set theory without the axiom of choice ( ZF ); it is easily proved by mathematical induction.

The debate is interesting enough, however, that it is considered of note when a theorem in ZFC ( ZF plus AC ) is logically equivalent ( with just the ZF axioms ) to the axiom of choice, and mathematicians look for results that require the axiom of choice to be false, though this type of deduction is less common than the type which requires the axiom of choice to be true.

In Martin-Löf type theory and higher-order Heyting arithmetic, the appropriate statement of the axiom of choice is ( depending on approach ) included as an axiom or provable as a theorem.

Assuming ZF is consistent, Kurt Gödel showed that the negation of the axiom of choice is not a theorem of ZF by constructing an inner model ( the constructible universe ) which satisfies ZFC and thus showing that ZFC is consistent.

Assuming ZF is consistent, Paul Cohen employed the technique of forcing, developed for this purpose, to show that the axiom of choice itself is not a theorem of ZF by constructing a much more complex model which satisfies ZF ¬ C ( ZF with the negation of AC added as axiom ) and thus showing that ZF ¬ C is consistent.

It is possible, however, that there is a shorter proof of a theorem from ZFC than from ZF.

** 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.

** Tychonoff's theorem stating that every product of compact topological spaces is compact.