User:Mysterytrey/sandbox/trial 3

In mathematics, a fingerprint database for theorems is any collection of theorems uniquely identified by a small canonical form which is independent of specialized notation or vocabulary. Such collections were first available in book format, but now the web hosts the majority of such collections. A key feature of web-based fingerprint databases is that anyone can access the collection and anyone can contribute. The best known fingerprint database for theorems is the On-Line Encyclopedia of Integer Sequences created by Neil Sloane. Other examples are listed below.

Wikipedia, the Math ArXiv, and the searchable part of the internet also include vast collections of theorems. However, these are not considered as having fingerprints based on the key features of a small canonical language – independent fingerprint.

Definition
A fingerprint database for theorems is a collection of mathematical information along with a method to uniquely or nearly uniquely distinguish each theorem in its collection in such a way that satisfies the following properties:
 * Canonical: To each theorem in the collection, one can associate an appropriate fingerprint.
 * Language-independent: The method of fingerprinting cannot depend on specialized vocabulary.
 * References: The fingerprint must point the user to references in the literature where the theorem is proved or is used.
 * Small: A fingerprint must be small enough that it is easily stored or computed.
 * Universality: It covers a range of topics.

Examples of fingerprint databases for theorems

 * Online Encyclopedia of Integer Sequences
 * Database of Permutation Pattern Avoidance
 * Findstat – The Combinatorial Statistic Finder
 * manYPoints – Table of Curves with Many Points