Construct · 3 fields · 4 citations

Where does completeness collide?

One name. Different field. Different construct. One map.

● jingle · one word, three constructs Nearest construct by meaning·not indexed
completeness3 CONSTRUCTSComplete metric spaceFRÉCHET · METRICSemantic completenessGÖDEL · 1930Complete statisticLEHMANN · SUFFICIENCY

Spokes are fields; dashed arcs are shared lineage. Tap a field for its definition, unit, and measures.

2026

Drag to watch the word get claimed. Each field appears at the publication date of the earliest source cited for it. Tap a year to see which.

Mathematical analysis

A space with no missing limit points

In mathematical analysis, a metric space is complete when every Cauchy sequence in it converges to a point that also lies in the space, so the space has no "holes" where a limit ought to be; the rationals are incomplete, and the real numbers are their completion. Fréchet's 1906 Sur quelques points du calcul fonctionnel introduced the abstract metric setting in which this property is defined, and Rudin's Principles of Mathematical Analysis gives the standard modern treatment. The referent is a structural property of a space, with nothing in common with a logic's proof power or a statistic's informational sufficiency beyond the shared word.[1][2]

Unit
Whether every Cauchy sequence in the space converges to a point within it
Recovery means
Not applicable
Measured by
Established by proving every Cauchy sequence has a limit in the space, or by constructing the space as the completion of a dense subspace

Mathematical logic

Everything true is also provable

In mathematical logic, a deductive system is complete when every statement that is true in all models (every logical validity) can actually be derived from its axioms and rules, so provability matches semantic consequence. Gödel's 1930 completeness theorem, Die Vollständigkeit der Axiome des logischen Funktionenkalküls, established exactly this for first-order predicate logic. The referent is a match between a proof calculus and logical truth, distinct from (and usually paired with) soundness, and not to be confused with Gödel's later incompleteness results about arithmetic.[3]

Unit
Whether every semantically valid formula is also derivable in the system
Recovery means
Not applicable
Measured by
Established by a completeness metatheorem showing every valid sentence is provable

Statistics

a statistic for which no non-trivial function has expected value zero across the whole family of distributions.

In statistics, a statistic is complete for a family of distributions when no non-trivial function of it has expected value zero across the whole family; intuitively, the statistic carries no "estimable" information that averages away to nothing for every parameter value. Lehmann and Casella's Theory of Point Estimation develops the notion, which together with sufficiency yields the Lehmann–Scheffé route to the best unbiased estimator. The referent is an informational property of an estimator, unrelated to a space's limit points or a logic's proof power.[4]

Unit
Whether only the zero function of the statistic has zero expectation at every parameter value
Recovery means
Not applicable
Measured by
Verified by showing that E[g(T)] = 0 for all parameter values forces g to be zero almost everywhere

Next

Run it through the Collider, or take the citations with you.

See how completeness sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in ColliderExport BibTeXReport this collision

Nearby collisions

compactness2 fields · 3 citationsjingle · one word, two constructsmetric4 fields · 4 citationsjingle · one word, four constructssoundness2 fields · 2 citationsjingle · one word, two constructs

References

  1. Fréchet, M. (1906). Sur quelques points du calcul fonctionnel. Rendiconti del Circolo Matematico di Palermo, 22(1), 1–72. https://doi.org/10.1007/BF03018603
  2. Rudin, W. (1976). Principles of mathematical analysis (3rd ed.). McGraw-Hill. ISBN 9780070542358
  3. Gödel, K. (1930). Die Vollständigkeit der Axiome des logischen Funktionenkalküls. Monatshefte für Mathematik und Physik, 37(1), 349–360. https://doi.org/10.1007/BF01696781
  4. Lehmann, E. L., & Casella, G. (1998). Theory of point estimation (2nd ed.). Springer. ISBN 9780387985022

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct