Misplaced Pages

Diversity (mathematics)

Article snapshot taken from Wikipedia with creative commons attribution-sharealike license. Give it a read and then ask your questions in the chat. We can research this topic together.
Generalization of metric spaces
This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these messages)
The topic of this article may not meet Misplaced Pages's general notability guideline. Please help to demonstrate the notability of the topic by citing reliable secondary sources that are independent of the topic and provide significant coverage of it beyond a mere trivial mention. If notability cannot be shown, the article is likely to be merged, redirected, or deleted.
Find sources: "Diversity" mathematics – news · newspapers · books · scholar · JSTOR (December 2022) (Learn how and when to remove this message)
This article relies largely or entirely on a single source. Relevant discussion may be found on the talk page. Please help improve this article by introducing citations to additional sources.
Find sources: "Diversity" mathematics – news · newspapers · books · scholar · JSTOR (December 2022)
(Learn how and when to remove this message)

In mathematics, a diversity is a generalization of the concept of metric space. The concept was introduced in 2012 by Bryant and Tupper, who call diversities "a form of multi-way metric". The concept finds application in nonlinear analysis.

Given a set X {\displaystyle X} , let fin ( X ) {\displaystyle \wp _{\mbox{fin}}(X)} be the set of finite subsets of X {\displaystyle X} . A diversity is a pair ( X , δ ) {\displaystyle (X,\delta )} consisting of a set X {\displaystyle X} and a function δ : fin ( X ) R {\displaystyle \delta \colon \wp _{\mbox{fin}}(X)\to \mathbb {R} } satisfying

(D1) δ ( A ) 0 {\displaystyle \delta (A)\geq 0} , with δ ( A ) = 0 {\displaystyle \delta (A)=0} if and only if | A | 1 {\displaystyle \left|A\right|\leq 1}

and

(D2) if B {\displaystyle B\neq \emptyset } then δ ( A C ) δ ( A B ) + δ ( B C ) {\displaystyle \delta (A\cup C)\leq \delta (A\cup B)+\delta (B\cup C)} .

Bryant and Tupper observe that these axioms imply monotonicity; that is, if A B {\displaystyle A\subseteq B} , then δ ( A ) δ ( B ) {\displaystyle \delta (A)\leq \delta (B)} . They state that the term "diversity" comes from the appearance of a special case of their definition in work on phylogenetic and ecological diversities. They give the following examples:

Diameter diversity

Let ( X , d ) {\displaystyle (X,d)} be a metric space. Setting δ ( A ) = max a , b A d ( a , b ) = diam ( A ) {\displaystyle \delta (A)=\max _{a,b\in A}d(a,b)=\operatorname {diam} (A)} for all A fin ( X ) {\displaystyle A\in \wp _{\mbox{fin}}(X)} defines a diversity.

L1 diversity

For all finite A R n {\displaystyle A\subseteq \mathbb {R} ^{n}} if we define δ ( A ) = i max a , b { | a i b i | : a , b A } {\displaystyle \delta (A)=\sum _{i}\max _{a,b}\left\{\left|a_{i}-b_{i}\right|\colon a,b\in A\right\}} then ( R n , δ ) {\displaystyle (\mathbb {R} ^{n},\delta )} is a diversity.

Phylogenetic diversity

If T is a phylogenetic tree with taxon set X. For each finite A X {\displaystyle A\subseteq X} , define δ ( A ) {\displaystyle \delta (A)} as the length of the smallest subtree of T connecting taxa in A. Then ( X , δ ) {\displaystyle (X,\delta )} is a (phylogenetic) diversity.

Steiner diversity

Let ( X , d ) {\displaystyle (X,d)} be a metric space. For each finite A X {\displaystyle A\subseteq X} , let δ ( A ) {\displaystyle \delta (A)} denote the minimum length of a Steiner tree within X connecting elements in A. Then ( X , δ ) {\displaystyle (X,\delta )} is a diversity.

Truncated diversity

Let ( X , δ ) {\displaystyle (X,\delta )} be a diversity. For all A fin ( X ) {\displaystyle A\in \wp _{\mbox{fin}}(X)} define δ ( k ) ( A ) = max { δ ( B ) : | B | k , B A } {\displaystyle \delta ^{(k)}(A)=\max \left\{\delta (B)\colon |B|\leq k,B\subseteq A\right\}} . Then if k 2 {\displaystyle k\geq 2} , ( X , δ ( k ) ) {\displaystyle (X,\delta ^{(k)})} is a diversity.

Clique diversity

If ( X , E ) {\displaystyle (X,E)} is a graph, and δ ( A ) {\displaystyle \delta (A)} is defined for any finite A as the largest clique of A, then ( X , δ ) {\displaystyle (X,\delta )} is a diversity.

References

  1. Bryant, David; Tupper, Paul (2012). "Hyperconvexity and tight-span theory for diversities". Advances in Mathematics. 231 (6): 3172–3198. arXiv:1006.1095. doi:10.1016/j.aim.2012.08.008.
  2. Bryant, David; Tupper, Paul (2014). "Diversities and the geometry of hypergraphs". Discrete Mathematics and Theoretical Computer Science. 16 (2): 1–20. arXiv:1312.5408.
  3. Espínola, Rafa; Pia̧tek, Bożena (2014). "Diversities, hyperconvexity, and fixed points". Nonlinear Analysis. 95: 229–245. doi:10.1016/j.na.2013.09.005. hdl:11441/43016. S2CID 119167622.


Stub icon

This metric geometry-related article is a stub. You can help Misplaced Pages by expanding it.

Categories: