Mathematics Atlas

How Proof Is Made
Sign In
Text size
100%
Theme
Theorem

Ugly Duckling Theorem

Combinatorics and Graph Theory

The ugly duckling theorem, in pattern recognition and the philosophy of classification, is an argument showing that classifying objects into similarity based categories is not possible without some prior bias about which properties matter. Under the assumption of finitely many logically definable properties and finitely many objects, the theorem shows that any two distinct objects share exactly the same number of properties in common, a symmetry that defeats any classification scheme built purely on counting shared properties. It is named, following Hans Christian Andersen's story, for the fact that on this measure a duckling is exactly as similar to a swan as two swans are to each other.

Facts
Statement
Any two different objects share the same number of (extensional) properties. 1
Proof Year
1969 1
Classification
Statement Form
Impossibility Theorem 1
Connections

Has Statement Form

Entity-backed identity for the statement-form enum value this theorem already carries, resolved to a mathematics concept by an explicit value-to-entity map (phase 3 bucket conversion, docs\design_entity_backed_browse_buckets_20260928.md). The statement-form fact itself stays on the theorem unchanged.

Sources
1. Ugly duckling theorem (Wikipedia)
  • Lead paragraph, core claim
    Any two different objects share the same number of (extensional) properties.
  • Lead paragraph, derivation
    It was derived by Satosi Watanabe in 1969.
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.