Formal theorem¶

In mathematics and formal logic, a theorem is a statement that has been proven, or can be proven.

Version: v1 · 2026-09-28 · History
Domain-specific #: 9538
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomain: Mathematical Logic → Mathematics

Core Idea¶

Formal theorem is treated here as the recurring mathematics identity summarized by this source-grounded definition: In mathematics and formal logic, a theorem is a statement that has been proven, or can be proven.

In mathematics and formal logic, a theorem is a statement that has been proven, or can be proven. The proof of a theorem is a logical argument that uses the inference rules of a deductive system to establish that the theorem is a logical consequence of the axioms and previously proved theorems. In mainstream mathematics, the axioms and the inference rules are commonly left implicit, and, in this case, they are almost always those of Zermelo–Fraenkel set theory with the axiom of choice (ZFC), or of a less powerful theory, such as Peano arithmetic.

Generally, an assertion that is explicitly called a theorem is a proved result that is not an immediate consequence of other known theorems. Moreover, many authors qualify as theorems only the most important results, and use the terms lemma, proposition and corollary for less important theorems. In mathematical logic, the concepts of theorems and proofs have been formalized in order to allow mathematical reasoning about them.

For Formal theorem, the abstraction is narrower than the article's general subject matter: a positive case must preserve In mathematics and formal logic, a theorem is a statement that has been proven, or can be proven. Retaining only the name, a familiar example, or a downstream effect is insufficient. The specialist roles and tests remain anchored in mathematics, which is why this identity is domain-specific rather than prime.

Structural Signature¶

Sig role-phrases:

Defining carrier — All theorems were proved by using these basic properties implicitly or explicitly.
Constitutive relation — One aspect of the foundational crisis of mathematics was the discovery of non-Euclidean geometries created by changing Euclid's fifth postulate.
Operating condition — This has been resolved by modifying the axioms that are allowed for manipulating sets.
Recognition evidence — In general, the crisis of the 19^th century was resolved by revisiting the foundations of mathematics to make them more rigorous.
Admissible variation — In these new foundations, a theorem is a well-formed formula of a mathematical theory that can be proved from the axioms and inference rules of the theory.
Characteristic consequence — Similarly, Russell's paradox disappears because, in modern axiomatized set theory, the set of all sets cannot be expressed with a well-formed formula.
Failure boundary — More precisely, if the set of all sets could be expressed with a well-formed formula, this would imply that the theory is inconsistent, and every well-formed assertion, as well as its negation, would be a theorem.

What It Is Not¶

Not the whole field of mathematics. The node requires the specific identity stated by In mathematics and formal logic, a theorem is a statement that has been proven, or can be proven.
Not an over-broad reading. These geometries do not lead to any internal contradictions, although, in such geometries, the sum of the angles of a triangle is different from 180°.
Not an over-broad reading. However, the conditional could also be interpreted differently in certain deductive systems, depending on the meanings assigned to the derivation rules and the conditional symbol (e.g., non-classical logic).
Not an over-broad reading. However, theorems are usually expressed in natural language rather than in a completely symbolic form—with the presumption that a formal statement can be derived from the informal one.
Not automatically Formal Theory. Retrieval proximity does not establish equivalence; the two identities must be compared by carrier, operation, and failure boundary.

Scope of Application¶

Formal theorem applies literally inside mathematics wherever the source-defined carrier and relation can be established. Its documented habitats include:

Theoremhood and truth. An important consequence of this way of thinking about mathematics is that it allows defining mathematical theories and theorems as mathematical objects, and to prove theorems about them.
Relation with scientific theories. Mathematical theorems, on the other hand, are purely abstract formal statements: the proof of a theorem cannot involve experiments or other empirical evidence in the same way such evidence is used to support scientific theories.
Relation with scientific theories. The Riemann hypothesis has been verified to hold for the first 10 trillion non-trivial zeroes of the zeta function.
Terminology. Riemann hypothesis), which should not be confused with "hypothesis" as the premise of a proof.
Terminology. Other terms are also used on occasion, for example problem when people are not sure whether the statement should be believed to be true.
Terminology. This should not be confused with "proposition" as used in propositional logic.

Outside mathematics, the name should be retained only when these same operational conditions survive; otherwise the comparison belongs to the broader parent Pattern or should be marked as analogy.

Clarity¶

A clear use of Formal theorem names the carrier, the operative relation, and the conditions under which the source treats the identity as present. The minimal definition is In mathematics and formal logic, a theorem is a statement that has been proven, or can be proven. The strongest recognition evidence in the frozen account is: In general, the crisis of the 19^th century was resolved by revisiting the foundations of mathematics to make them more rigorous. A report should distinguish that evidence from a proxy, consequence, or common implementation. It should also state the qualification These geometries do not lead to any internal contradictions, although, in such geometries, the sum of the angles of a triangle is different from 180°. so that a reader can reproduce the classification rather than infer it from topical resemblance.

Manages Complexity¶

Formal theorem compresses multiple mathematics details into a stable diagnostic relation. The source shows both the central mechanism—one aspect of the foundational crisis of mathematics was the discovery of non-Euclidean geometries created by changing Euclid's fifth postulate.—and the practical consequence—similarly, Russell's paradox disappears because, in modern axiomatized set theory, the set of all sets cannot be expressed with a well-formed formula. This compression makes cases comparable while leaving parameters, conventions, exceptions, and evidential quality explicit. It is lossy by design: local history and implementation details may be omitted only when they do not alter the defining relation.

Abstract Reasoning¶

Type the carrier. Identify the mathematics entities to which the claim applies.
State the relation. Use the source-grounded identity: In mathematics and formal logic, a theorem is a statement that has been proven, or can be proven.
Check operation and conditions. This has been resolved by modifying the axioms that are allowed for manipulating sets.
Demand recognition evidence. In general, the crisis of the 19^th century was resolved by revisiting the foundations of mathematics to make them more rigorous.
Test variation. Change an implementation or setting while preserving in these new foundations, a theorem is a well-formed formula of a mathematical theory that can be proved from the axioms and inference rules of the theory.
Run the collapse test. Remove the defining operation; if the label still seems equally apt, only a topic or correlate was retained.
Reduce cautiously. When the specialist conditions cannot be carried, route the residual comparison to Pattern.

Knowledge Transfer¶

Within the home domain. Knowledge about Formal theorem transfers literally when a new case preserves the same carrier type, relation, and recognition test. An important consequence of this way of thinking about mathematics is that it allows defining mathematical theories and theorems as mathematical objects, and to prove theorems about them. Mathematical theorems, on the other hand, are purely abstract formal statements: the proof of a theorem cannot involve experiments or other empirical evidence in the same way such evidence is used to support scientific theories.

Beyond the home domain. No canonical parent is asserted for Formal theorem. An outside case receives the specialist name only when the same typed roles and rejection conditions can be filled literally; otherwise the comparison remains an analogy pending later graph densification.

Examples¶

Canonical¶

Although theorems can be written in a completely symbolic form (e.g., as propositions in propositional calculus), they are often expressed informally in a natural language such as English for better readability. This case is canonical because it supplies a concrete carrier and lets the defining relation be checked rather than merely named.

Mapped back: carrier → the entities in the documented case; operation → In mathematics and formal logic, a theorem is a statement that has been proven, or can be proven; recognition evidence → In general, the crisis of the 19^th century was resolved by revisiting the foundations of mathematics to make them more rigorous

Applied / In Practice¶

A corollary may also be a restatement of a theorem in a simpler form, or for a special case: for example, the theorem "all internal angles in a rectangle are right angles" has a corollary that "all internal angles in a square are right angles" — a square being a special case of a rectangle. The applied case shows how the identity is used under a second setting or qualification while keeping the same operative relation.

Mapped back: changed setting → Terminology; invariant → In mathematics and formal logic, a theorem is a statement that has been proven, or can be proven; boundary → the case exits the class when these geometries do not lead to any internal contradictions, although, in such geometries, the sum of the angles of a triangle is different from 180°

Structural Tensions¶

T1 — Stable identity versus admissible variation. These geometries do not lead to any internal contradictions, although, in such geometries, the sum of the angles of a triangle is different from 180°. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Which changes preserve the defining relation, and which replace it?

T2 — Recognition versus proxy. However, the conditional could also be interpreted differently in certain deductive systems, depending on the meanings assigned to the derivation rules and the conditional symbol (e.g., non-classical logic). The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Does the cited evidence establish the identity or only a correlated sign?

T3 — Definition versus implementation. However, theorems are usually expressed in natural language rather than in a completely symbolic form—with the presumption that a formal statement can be derived from the informal one. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Is the observed implementation constitutive, optional, or merely common?

T4 — Scope versus overextension. In particular, there are well-formed assertions that can be proved to not be a theorem of the ambient theory, although they can be proved in a wider theory. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Can every claimed application fill the same typed roles without metaphor?

T5 — Transfer versus domain accent. All theorems were proved by using these basic properties implicitly or explicitly. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Does the receiving case instantiate Formal theorem literally, co-instantiate Pattern, or only resemble it?

T6 — Autonomy versus reduction. One aspect of the foundational crisis of mathematics was the discovery of non-Euclidean geometries created by changing Euclid's fifth postulate. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: What does Formal theorem distinguish that the broader parent Pattern leaves together?

Structural–Framed Character¶

Formal theorem is structural-leaning. Its structural side is the repeatable organization summarized by In mathematics and formal logic, a theorem is a statement that has been proven, or can be proven. Its framed side is the mathematics vocabulary that fixes the carrier, evidence, exceptions, and admissible transformations.

Evaluative weight: the identity can be stated descriptively even when applications carry practical stakes. Human-practice dependence: the source-grounded carrier determines whether the relation exists independently or is constituted by a practice. Institutional origin: disciplinary conventions stabilize the name and test. Vocabulary portability: This has been resolved by modifying the axioms that are allowed for manipulating sets. Import versus recognition: literal transfer requires the same mechanism; shape alone is analogy.

Its portable skeleton is Pattern. Its character: a recurring specialist identity whose thin organization can be abstracted, while its operational meaning remains domain-bound.

Structural Core vs. Domain Accent¶

What is skeletal. In mathematics and formal logic, a theorem is a statement that has been proven, or can be proven. The stable skeleton is the typed relation expressed in that definition and the entry's recognition and collapse tests. The source identifies these operative conditions: All theorems were proved by using these basic properties implicitly or explicitly. One aspect of the foundational crisis of mathematics was the discovery of non-Euclidean geometries created by changing Euclid's fifth postulate. It further constrains recognition and variation through: This has been resolved by modifying the axioms that are allowed for manipulating sets. In general, the crisis of the 19^th century was resolved by revisiting the foundations of mathematics to make them more rigorous.

What is domain-bound. mathematics supplies the operative entities, technical vocabulary, warrants, and exceptions that make Formal theorem literal. Its documented scope includes the condition that An important consequence of this way of thinking about mathematics is that it allows defining mathematical theories and theorems as mathematical objects, and to prove theorems about them. Another bounded application condition is that Mathematical theorems, on the other hand, are purely abstract formal statements: the proof of a theorem cannot involve experiments or other empirical evidence in the same way such evidence is used to support scientific theories. These are not decorative examples; they determine which carrier and evidence can fill the abstraction's roles.

Why no parent is asserted. Removing those specialist details does not currently yield one live catalog node that is a necessary genus for every instance. The entry is therefore approved as unparented rather than attached by topical resemblance. Its collapse evidence remains specific—In these new foundations, a theorem is a well-formed formula of a mathematical theory that can be proved from the axioms and inference rules of the theory.—and future graph densification may discover a defensible relation only if it preserves that boundary.

This entry presupposes Formal System.

Approved unparented node. No current live node supplies a defensible necessary genus or structural prerequisite for Formal theorem. The reviewed identity is: In mathematics and formal logic, a theorem is a statement that has been proven, or can be proven. The accelerated suggestion was declined because topical or lexical similarity does not establish hierarchy; the node is admitted without a parent pending later graph densification.
Related reasoning operations. Evidence, representation, comparison, classification, transformation, or evaluation may participate in particular cases, but participation does not make any one of them a necessary parent of every instance.

Relationships to Other Abstractions¶

Current abstraction Formal theorem Domain-specific

Parents (1) — more general patterns this builds on

Formal theorem presupposes Formal System Prime

A mathematical theorem is proved from axioms and inference rules within a mathematical theory or formal system.

Children (13) — more specific cases that build on this

Bernstein's Theorem (Polynomials) Domain-specific is a kind of Formal theorem

Bernstein's polynomial derivative inequality is a proved formal theorem.
Cook–Levin Theorem Domain-specific is a kind of Formal theorem

Cook–Levin is a proved formal theorem about SAT membership and NP-hardness under polynomial reductions.
Euler's Formula Domain-specific is a kind of Formal theorem

Euler's complex-exponential formula is a proved mathematical identity specializing Formal Theorem.

▸ Show 10 more

Grothendieck–Riemann–Roch theorem Domain-specific is a kind of Formal theorem
Grothendieck–Riemann–Roch is a proved mathematical statement with explicit hypotheses and a characteristic-class conclusion.
Hook Length Formula Domain-specific is a kind of Formal theorem
The hook-length formula is a formal theorem.
Kolmogorov's Two-Series Theorem Domain-specific is a kind of Formal theorem
The named two-series result is a proved mathematical statement specializing Formal Theorem.
Lebesgue's Density Theorem Domain-specific is a kind of Formal theorem
Lebesgue's density theorem is a specific proved mathematical statement about local measure.
Milman's reverse Brunn–Minkowski inequality Domain-specific is a kind of Formal theorem
Milman's named reverse inequality is a proved mathematical statement with hypotheses and a conclusion; other formal theorems need not concern convex bodies.
Resolution Theorem (Algebraic K-Theory) Domain-specific is a kind of Formal theorem
Quillen's resolution theorem is a formal theorem.
Spitzer's Formula Domain-specific is a kind of Formal theorem
Spitzer's formula is a proved theorem specialized to an i.i.d. walk maximum and positive-part transform equality.
Von Neumann's Closed-Operator Theorem Domain-specific is a kind of Formal theorem
The closed-operator adjoint-product result is a proved formal theorem.
Weyl's Theorem on Complete Reducibility Domain-specific is a kind of Formal theorem
Weyl complete reducibility is a proven statement with fixed Lie-algebra hypotheses and a splitting conclusion.
Zyablov Bound Domain-specific is a kind of Formal theorem
The Zyablov bound is a proved coding-theoretic achievability theorem.

Hierarchy paths (2) — routes to 2 parentless roots

Formal theorem → Formal System → Formalization → Representation → Abstraction

Show alternative path (1)

Neighborhood in Abstraction Space¶

Formal theorem sits in a moderately populated region (55^th percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.

Family — Geometric Figures & Constructions (32 abstractions)

Nearest neighbors

Characterization (mathematics) — 0.86
Gödel sentence — 0.86
Construction of the Real Numbers — 0.85
Kripke–Platek set theory with urelements — 0.85
Non-Archimedean geometry — 0.85

Computed from structural-signature embeddings · 2026-10-08

Not to Be Confused With¶

Pattern. The parent omits the specialist differentia. Tell: Can the case establish In mathematics and formal logic, a theorem is a statement that has been proven, or can be proven?
Formal Theory. A set of sentences in a formal language, commonly closed under a specified consequence relation, that serves as the asserted or derivable content interpreted within models. Tell: Which entry's carrier, operation, and failure condition are satisfied?
Proof By Contradiction. Establish a claim by assuming its negation and deriving an impossibility. Tell: Which entry's carrier, operation, and failure condition are satisfied?
Deductive Reasoning. General to specific conclusions. Tell: Which entry's carrier, operation, and failure condition are satisfied?
A measurement, proxy, or consequence. Those may provide evidence without being the identity. Tell: Would Formal theorem remain present if the detector or downstream effect changed?
A metaphorical analogue. A similar shape outside mathematics lacks the specialist mechanism. Tell: Do the native roles transfer literally, or only the parent Pattern?

References¶

Frozen Wikipedia discovery revision: https://en.wikipedia.org/wiki/Theorem (revision 1360039713).
Preserved source candidate: http://www.eric.ed.gov/PDFS/ED037335.pdf
Preserved source candidate: https://www.lexico.com/en/definition/theorem
Preserved source candidate: https://web.archive.org/web/20191102041621/https://www.lexico.com/en/definition/theorem
Preserved source candidate: https://plato.stanford.edu/archives/fall2017/entries/rationalism-empiricism/
Preserved source candidate: http://www.math.mcgill.ca/darmon/pub/Articles/Expository/05.DDT/paper.pdf
Preserved source candidate: http://intrologic.stanford.edu/glossary/implication.html
Preserved source candidate: http://www.math.rutgers.edu/~zeilberg/Opinion51.html
Preserved source candidate: https://archive.org/details/planegeometry00gwen/page/n25/

The frozen Wikipedia revision is discovery provenance. The retained source set was reviewed for identity, formal or operational relation, and scope. The encyclopedia's structural synthesis is bounded to those claims; a thin authority surface is recorded as a nonblocking source-strengthening repair rather than concealed.