Size functor

Size functor

Given a size pair (M,f) where M is a manifold of dimensionn and f is an arbitrary real continuous function definedon it, the i -th " size functor"Francesca Cagliari, Massimo Ferri, Paola Pozzi, "Size functions from a categorical viewpoint", Acta Applicandae Mathematicae, 67(3):225-235, 2001.] , with i=0,ldots,n , denotedby F_i , is the functor in Fun(mathrm{Rord},mathrm{Ab}) , where mathrm{Rord} is the category of ordered real numbers, and mathrm{Ab} is the category of Abelian groups, defined in the following way. For xle y , setting M_x={pin M:f(p)le x} , M_y={pin M:f(p)le y} , j_{xy} equal to the inclusion from M_x into M_y , and k_{xy} equal to the morphism in mathrm{Rord} from x to y ,

* for each xinR , F_i(x)=H_i(M_x);
* F_i(k_{xy})=H_i(j_{xy}).

In other words, the size functor studies theprocess of the birth and death of homology classes as the lower level set changes.When M is smooth and compact and f is a Morse function, the functor F_0 can bedescribed by oriented trees, called H_0 − trees.

The concept of size functor was introduced as an extension to homology theory and category theory of the idea of size function. The main motivation for introducing the size functor originated by the observation that the size function ell_{(M,f)}(x, y) can be seen as the rankof the image of H_0(j_{xy}) : H_0(M_x) ightarrow H_0(M_y).

The concept of size functor is strictly related to the concept of persistent homology groupHerbert Edelsbrunner, David Letscher, Afra Zomorodian, "Topological Persistence and Simplification", Discrete and Computational Geometry, 28(4):511-533, 2002.] , studied in persistent homology. It is worth to point out that the i -th persistent homology group coincides with the image of the homomorphism F_i(k_{xy})=H_i(j_{xy}): H_i(M_x) ightarrow H_i(M_y).

References

ee also

* Size theory
* Size function
* Size homotopy group
* Size pair


Wikimedia Foundation. 2010.

Игры ⚽ Нужно решить контрольную?

Look at other dictionaries:

  • Size function — Size functions are shape descriptors, in a geometrical/topological sense. They are functions from the half plane to the natural numbers, counting certain connected components of a topological space. They are used in pattern recognition and… …   Wikipedia

  • Size homotopy group — The concept of size homotopy group is the anologous in size theory of the classical concept of homotopy group. In order to give its definition, let us assume that a size pair (M,varphi) is given, where M is a closed manifold of class C^0 and… …   Wikipedia

  • Size pair — In size theory, a size pair is a pair (M,varphi), where M is a compact topological space and varphi:M o mathbb{R}^k is a continuous function Patrizio Frosini, Claudia Landi, Size theory as a topological tool for computer vision , Pattern… …   Wikipedia

  • Matching distance — In mathematics, the matching distance[1][2] is a metric on the space of size functions. Example: The matching distance between …   Wikipedia

  • Natural pseudodistance — In size theory, the natural pseudodistance between two size pairs , is the value , where varies in the set of all homeomorphisms from the manifold to the manifold and …   Wikipedia

  • Measuring function — In size theory, a measuring function is a continuous function from a topological space M to mathbb{R}^k . Patrizio Frosini, Claudia Landi, Size theory as a topological tool for computer vision , Pattern Recognition And Image Analysis, 9(4):596… …   Wikipedia

  • List of mathematics articles (S) — NOTOC S S duality S matrix S plane S transform S unit S.O.S. Mathematics SA subgroup Saccheri quadrilateral Sacks spiral Sacred geometry Saddle node bifurcation Saddle point Saddle surface Sadleirian Professor of Pure Mathematics Safe prime Safe… …   Wikipedia

  • Combinatorial species — In combinatorial mathematics, the theory of combinatorial species is an abstract, systematic method for analysing discrete structures in terms of generating functions. Examples of discrete structures are (finite) graphs, permutations, trees, and… …   Wikipedia

  • Memoization — Not to be confused with Memorization. In computing, memoization is an optimization technique used primarily to speed up computer programs by having function calls avoid repeating the calculation of results for previously processed inputs.… …   Wikipedia

  • Intuitionistic type theory — Intuitionistic type theory, or constructive type theory, or Martin Löf type theory or just Type Theory is a logical system and a set theory based on the principles of mathematical constructivism. Intuitionistic type theory was introduced by Per… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”