Finite subdivision rule

Last updated

A perspective projection of a dodecahedral tessellation in H. Note the recursive structure: each pentagon contains smaller pentagons, which contain smaller pentagons. This is an example of a subdivision rule arising from a finite universe (i.e. a closed 3-manifold). Hyperbolic orthogonal dodecahedral honeycomb.png
A perspective projection of a dodecahedral tessellation in H . Note the recursive structure: each pentagon contains smaller pentagons, which contain smaller pentagons. This is an example of a subdivision rule arising from a finite universe (i.e. a closed 3-manifold).

In mathematics, a finite subdivision rule is a recursive way of dividing a polygon or other two-dimensional shape into smaller and smaller pieces. Subdivision rules in a sense are generalizations of regular geometric fractals. Instead of repeating exactly the same design over and over, they have slight variations in each stage, allowing a richer structure while maintaining the elegant style of fractals. [1] Subdivision rules have been used in architecture, biology, and computer science, as well as in the study of hyperbolic manifolds. Substitution tilings are a well-studied type of subdivision rule.

Contents

Definition

A subdivision rule takes a tiling of the plane by polygons and turns it into a new tiling by subdividingeach polygon into smaller polygons. It is finite if there are only finitely many ways that every polygon can subdivide. Each way of subdividing a tile is called a tile type. Each tile type is represented by a label (usually a letter). Every tile type subdivides into smaller tile types. Each edge also gets subdivided according to finitely many edge types. Finite subdivision rules can only subdivide tilings that are made up of polygons labelled by tile types. Such tilings are called subdivision complexes for the subdivision rule. Given any subdivision complex for a subdivision rule, we can subdivide it over and over again to get a sequence of tilings.

For instance, binary subdivision has one tile type and one edge type:

The binary subdivision rule The binary subdivision rule.png
The binary subdivision rule

Since the only tile type is a quadrilateral, binary subdivision can only subdivide tilings made up of quadrilaterals. This means that the only subdivision complexes are tilings by quadrilaterals. The tiling can be regular, but doesn't have to be:

We start with a complex with four quadrilaterals and subdivide twice. All squares are type A tiles. BinarySubdivisionComplex2.png
We start with a complex with four quadrilaterals and subdivide twice. All squares are type A tiles.

Here we start with a complex made of four quadrilaterals and subdivide it twice. All quadrilaterals are type A tiles.

Examples of finite subdivision rules

Barycentric subdivision is an example of a subdivision rule with one edge type (that gets subdivided into two edges) and one tile type (a triangle that gets subdivided into 6 smaller triangles). Any triangulated surface is a barycentric subdivision complex. [1]

The Penrose tiling can be generated by a subdivision rule on a set of four tile types (the curved lines in the table below only help to show how the tiles fit together):

NameInitial tilesGeneration 1Generation 2Generation 3
Half-kite Penrose kile 0.svg Penrose kile 1.svg Penrose kile 2.svg Penrose kile 3.svg
Half-dart Penrose dart 0.svg Penrose dart 1.svg Penrose dart 2.svg Penrose dart 3.svg
Sun Penrose sun 0bis.svg Penrose sun 1.svg Penrose sun 2.svg Penrose sun 3.svg
Star Penrose star 0.svg Penrose star 1.svg Penrose star 2.svg Penrose star 3.svg

Certain rational maps give rise to finite subdivision rules. [2] This includes most Lattès maps. [3]

Every prime, non-split alternating knot or link complement has a subdivision rule, with some tiles that do not subdivide, corresponding to the boundary of the link complement. [4] The subdivision rules show what the night sky would look like to someone living in a knot complement; because the universe wraps around itself (i.e. is not simply connected), an observer would see the visible universe repeat itself in an infinite pattern. The subdivision rule describes that pattern.

The subdivision rule looks different for different geometries. This is a subdivision rule for the trefoil knot, which is not a hyperbolic knot:

Trefoil subdivision rule Trefoil subdivision rule.png
Trefoil subdivision rule

And this is the subdivision rule for the Borromean rings, which is hyperbolic:

Borromean subdivision rule Borromean subdivision rule.png
Borromean subdivision rule

In each case, the subdivision rule would act on some tiling of a sphere (i.e. the night sky), but it is easier to just draw a small part of the night sky, corresponding to a single tile being repeatedly subdivided. This is what happens for the trefoil knot:

Subdivisions of the subdivision complex for the trefoil complement. Finite subdivisions for the trefoil knot complement.png
Subdivisions of the subdivision complex for the trefoil complement.

And for the Borromean rings:

Subdivisions of the subdivision complex for the Borromean rings complement. Finite subdivisions for the Borromean rings complement.png
Subdivisions of the subdivision complex for the Borromean rings complement.

Subdivision rules in higher dimensions

Subdivision rules can easily be generalized to other dimensions. [5] For instance, barycentric subdivision is used in all dimensions. Also, binary subdivision can be generalized to other dimensions (where hypercubes get divided by every midplane), as in the proof of the Heine–Borel theorem.

Rigorous definition

A subdivision rule for the four-torus. The faces of the B tiles that subdivide can only touch C tiles, and the faces of the B tiles that don't only touch A tiles. FourTorusSubdivision.svg
A subdivision rule for the four-torus. The faces of the B tiles that subdivide can only touch C tiles, and the faces of the B tiles that don't only touch A tiles.

A finite subdivision rule consists of the following. [1]

1. A finite 2-dimensional CW complex , called the subdivision complex, with a fixed cell structure such that is the union of its closed 2-cells. We assume that for each closed 2-cell of there is a CW structure on a closed 2-disk such that has at least two vertices, the vertices and edges of are contained in , and the characteristic map which maps onto restricts to a homeomorphism onto each open cell.

2. A finite two dimensional CW complex , which is a subdivision of .

3.A continuous cellular map called the subdivision map, whose restriction to every open cell is a homeomorphism onto an open cell.

Each CW complex in the definition above (with its given characteristic map ) is called a tile type.

An -complex for a subdivision rule is a 2-dimensional CW complex which is the union of its closed 2-cells, together with a continuous cellular map whose restriction to each open cell is a homeomorphism. We can subdivide into a complex by requiring that the induced map restricts to a homeomorphism onto each open cell. is again an -complex with map . By repeating this process, we obtain a sequence of subdivided -complexes with maps .

Binary subdivision is one example: [6]

The binary subdivision rule. The binary subdivision rule.png
The binary subdivision rule.

The subdivision complex can be created by gluing together the opposite edges of the square, making the subdivision complex into a torus. The subdivision map is the doubling map on the torus, wrapping the meridian around itself twice and the longitude around itself twice. This is a four-fold covering map. The plane, tiled by squares, is a subdivision complex for this subdivision rule, with the structure map given by the standard covering map. Under subdivision, each square in the plane gets subdivided into squares of one-fourth the size.

Quasi-isometry properties

The history graph of the middle thirds subdivision rule. CantorHistoryGraph.png
The history graph of the middle thirds subdivision rule.

Subdivision rules can be used to study the quasi-isometry properties of certain spaces. [7] Given a subdivision rule and subdivision complex , we can construct a graph called the history graph that records the action of the subdivision rule. The graph consists of the dual graphs of every stage , together with edges connecting each tile in with its subdivisions in .

The quasi-isometry properties of the history graph can be studied using subdivision rules. For instance, the history graph is quasi-isometric to hyperbolic space exactly when the subdivision rule is conformal, as described in the combinatorial Riemann mapping theorem. [7]

Applications

Applications of subdivision rules.
Darbeimam subdivision rule.svg
An example of a subdivision rule used in the Islamic art known as girih.
Catmull-Clark subdivision of a cube.svg
First three steps of Catmull-Clark subdivision of a cube with subdivision surface below.
Gray961.png
The branching nature of bronchi may be modelled by finite subdivision rules.

Islamic Girih tiles in Islamic architecture are self-similar tilings that can be modeled with finite subdivision rules. [8] In 2007, Peter J. Lu of Harvard University and Professor Paul J. Steinhardt of Princeton University published a paper in the journal Science suggesting that girih tilings possessed properties consistent with self-similar fractal quasicrystalline tilings such as Penrose tilings (presentation 1974, predecessor works starting in about 1964) predating them by five centuries. [8]

Subdivision surfaces in computer graphics use subdivision rules to refine a surface to any given level of precision. These subdivision surfaces (such as the Catmull-Clark subdivision surface) take a polygon mesh (the kind used in 3D animated movies) and refines it to a mesh with more polygons by adding and shifting points according to different recursive formulas. [9] Although many points get shifted in this process, each new mesh is combinatorially a subdivision of the old mesh (meaning that for every edge and vertex of the old mesh, you can identify a corresponding edge and vertex in the new one, plus several more edges and vertices).

Subdivision rules were applied by Cannon, Floyd and Parry (2000) to the study of large-scale growth patterns of biological organisms. [6] Cannon, Floyd and Parry produced a mathematical growth model which demonstrated that some systems determined by simple finite subdivision rules can results in objects (in their example, a tree trunk) whose large-scale form oscillates wildly over time even though the local subdivision laws remain the same. [6] Cannon, Floyd and Parry also applied their model to the analysis of the growth patterns of rat tissue. [6] They suggested that the "negatively curved" (or non-euclidean) nature of microscopic growth patterns of biological organisms is one of the key reasons why large-scale organisms do not look like crystals or polyhedral shapes but in fact in many cases resemble self-similar fractals. [6] In particular they suggested that such "negatively curved" local structure is manifested in highly folded and highly connected nature of the brain and the lung tissue. [6]

Cannon's conjecture

Cannon, Floyd, and Parry first studied finite subdivision rules in an attempt to prove the following conjecture:

Cannon's conjecture: Every Gromov hyperbolic group with a 2-sphere at infinity acts geometrically on hyperbolic 3-space. [7]

Here, a geometric action is a cocompact, properly discontinuous action by isometries. This conjecture was partially solved by Grigori Perelman in his proof [10] [11] [12] of the geometrization conjecture, which states (in part) than any Gromov hyperbolic group that is a 3-manifold group must act geometrically on hyperbolic 3-space. However, it still remains to show that a Gromov hyperbolic group with a 2-sphere at infinity is a 3-manifold group.

Cannon and Swenson showed [13] that a hyperbolic group with a 2-sphere at infinity has an associated subdivision rule. If this subdivision rule is conformal in a certain sense, the group will be a 3-manifold group with the geometry of hyperbolic 3-space. [7]

Combinatorial Riemann mapping theorem

Subdivision rules give a sequence of tilings of a surface, and tilings give an idea of distance, length, and area (by letting each tile have length and area 1). In the limit, the distances that come from these tilings may converge in some sense to an analytic structure on the surface. The Combinatorial Riemann Mapping Theorem gives necessary and sufficient conditions for this to occur. [7]

Its statement needs some background. A tiling of a ring (i.e., a closed annulus) gives two invariants, and , called approximate moduli. These are similar to the classical modulus of a ring. They are defined by the use of weight functions. A weight function assigns a non-negative number called a weight to each tile of . Every path in can be given a length, defined to be the sum of the weights of all tiles in the path. Define the height of under to be the infimum of the length of all possible paths connecting the inner boundary of to the outer boundary. The circumference of under is the infimum of the length of all possible paths circling the ring (i.e. not nullhomotopic in R). The area of under is defined to be the sum of the squares of all weights in . Then define

Note that they are invariant under scaling of the metric.

A sequence of tilings is conformal () if mesh approaches 0 and:

  1. For each ring , the approximate moduli and , for all sufficiently large, lie in a single interval of the form ; and
  2. Given a point in the surface, a neighborhood of , and an integer , there is a ring in separating x from the complement of , such that for all large the approximate moduli of are all greater than . [7]

Statement of theorem

If a sequence of tilings of a surface is conformal () in the above sense, then there is a conformal structure on the surface and a constant depending only on in which the classical moduli and approximate moduli (from for sufficiently large) of any given annulus are -comparable, meaning that they lie in a single interval . [7]

Consequences

The Combinatorial Riemann Mapping Theorem implies that a group acts geometrically on if and only if it is Gromov hyperbolic, it has a sphere at infinity, and the natural subdivision rule on the sphere gives rise to a sequence of tilings that is conformal in the sense above. Thus, Cannon's conjecture would be true if all such subdivision rules were conformal. [13]

Related Research Articles

In complex analysis, an entire function, also called an integral function, is a complex-valued function that is holomorphic on the whole complex plane. Typical examples of entire functions are polynomials and the exponential function, and any finite sums, products and compositions of these, such as the trigonometric functions sine and cosine and their hyperbolic counterparts sinh and cosh, as well as derivatives and integrals of entire functions such as the error function. If an entire function has a root at , then , taking the limit value at , is an entire function. On the other hand, the natural logarithm, the reciprocal function, and the square root are all not entire functions, nor can they be continued analytically to an entire function.

In mathematics, the operator norm measures the "size" of certain linear operators by assigning each a real number called its operator norm. Formally, it is a norm defined on the space of bounded linear operators between two given normed vector spaces.

In the mathematical disciplines of topology and geometry, an orbifold is a generalization of a manifold. Roughly speaking, an orbifold is a topological space which is locally a finite group quotient of a Euclidean space.

<span class="mw-page-title-main">Conformal group</span>

In mathematics, the conformal group of an inner product space is the group of transformations from the space to itself that preserve angles. More formally, it is the group of transformations that preserve the conformal geometry of the space.

In mathematics, the ratio test is a test for the convergence of a series

In mathematics, Schur's lemma is an elementary but extremely useful statement in representation theory of groups and algebras. In the group case it says that if M and N are two finite-dimensional irreducible representations of a group G and φ is a linear map from M to N that commutes with the action of the group, then either φ is invertible, or φ = 0. An important special case occurs when M = N, i.e. φ is a self-map; in particular, any element of the center of a group must act as a scalar operator on M. The lemma is named after Issai Schur who used it to prove the Schur orthogonality relations and develop the basics of the representation theory of finite groups. Schur's lemma admits generalisations to Lie groups and Lie algebras, the most common of which are due to Jacques Dixmier and Daniel Quillen.

<span class="mw-page-title-main">Barycentric subdivision</span>

In mathematics, the barycentric subdivision is a standard way to subdivide a given simplex into smaller ones. Its extension on simplicial complexes is a canonical method to refine them. Therefore, the barycentric subdivision is an important tool in algebraic topology.

In quantum information theory, a quantum channel is a communication channel which can transmit quantum information, as well as classical information. An example of quantum information is the state of a qubit. An example of classical information is a text document transmitted over the Internet.

In mathematics, a comodule or corepresentation is a concept dual to a module. The definition of a comodule over a coalgebra is formed by dualizing the definition of a module over an associative algebra.

In mathematics, a Fuchsian model is a representation of a hyperbolic Riemann surface R as a quotient of the upper half-plane H by a Fuchsian group. Every hyperbolic Riemann surface admits such a representation. The concept is named after Lazarus Fuchs.

In mathematics, the root test is a criterion for the convergence of an infinite series. It depends on the quantity

In mathematics, the Teichmüller space of a (real) topological surface , is a space that parametrizes complex structures on up to the action of homeomorphisms that are isotopic to the identity homeomorphism. Teichmüller spaces are named after Oswald Teichmüller.

In physics and particularly in particle physics, a multiplet is the state space for 'internal' degrees of freedom of a particle, that is, degrees of freedom associated to a particle itself, as opposed to 'external' degrees of freedom such as the particle's position in space. Examples of such degrees of freedom are the spin state of a particle in quantum mechanics, or the color, isospin and hypercharge state of particles in the Standard model of particle physics. Formally, we describe this state space by a vector space which carries the action of a group of continuous symmetries.

Discounted maximum loss, also known as worst-case risk measure, is the present value of the worst-case scenario for a financial portfolio.

<span class="mw-page-title-main">William Floyd (mathematician)</span> American mathematician

William J. Floyd is an American mathematician specializing in topology. He is currently a professor at Virginia Polytechnic Institute and State University. Floyd received a PhD in Mathematics from Princeton University 1978 under the direction of William Thurston.

James W. Cannon is an American mathematician working in the areas of low-dimensional topology and geometric group theory. He was an Orson Pratt Professor of Mathematics at Brigham Young University.

Bloch's Principle is a philosophical principle in mathematics stated by André Bloch.

In mathematics, the classical Möbius plane is the Euclidean plane supplemented by a single point at infinity. It is also called the inversive plane because it is closed under inversion with respect to any generalized circle, and thus a natural setting for planar inversive geometry.

The min-entropy, in information theory, is the smallest of the Rényi family of entropies, corresponding to the most conservative way of measuring the unpredictability of a set of outcomes, as the negative logarithm of the probability of the most likely outcome. The various Rényi entropies are all equal for a uniform distribution, but measure the unpredictability of a nonuniform distribution in different ways. The min-entropy is never greater than the ordinary or Shannon entropy and that in turn is never greater than the Hartley or max-entropy, defined as the logarithm of the number of outcomes with nonzero probability.

In mathematics, a Cannon–Thurston map is any of a number of continuous group-equivariant maps between the boundaries of two hyperbolic metric spaces extending a discrete isometric actions of the group on those spaces.

References

  1. 1 2 3 J. W. Cannon, W. J. Floyd, W. R. Parry. Finite subdivision rules . Conformal Geometry and Dynamics, vol. 5 (2001), pp. 153196.
  2. J. W. Cannon, W. J. Floyd, W. R. Parry. Constructing subdivision rules from rational maps . Conformal Geometry and Dynamics, vol. 11 (2007), pp. 128136.
  3. J. W. Cannon, W. J. Floyd, W. R. Parry. Lattès maps and subdivision rules. Conformal Geometry and Dynamics, vol. 14 (2010, pp. 113140.
  4. B. Rushton. Constructing subdivision rules from alternating links . Conform. Geom. Dyn. 14 (2010), 113.
  5. Rushton, B. (2012). "A finite subdivision rule for the n-dimensional torus". Geometriae Dedicata. 167: 23–34. arXiv: 1110.3310 . doi:10.1007/s10711-012-9802-5. S2CID   119145306.
  6. 1 2 3 4 5 6 J. W. Cannon, W. Floyd and W. Parry. Crystal growth, biological cell growth and geometry. Pattern Formation in Biology, Vision and Dynamics, pp. 6582. World Scientific, 2000. ISBN   981-02-3792-8, ISBN   978-981-02-3792-9.
  7. 1 2 3 4 5 6 7 James W. Cannon. The combinatorial Riemann mapping theorem. Acta Mathematica 173 (1994), no. 2, pp. 155234.
  8. 1 2 Lu, Peter J.; Steinhardt, Paul J. (2007). "Decagonal and Quasi-crystalline Tilings in Medieval Islamic Architecture" (PDF). Science . 315 (5815): 1106–1110. Bibcode:2007Sci...315.1106L. doi:10.1126/science.1135491. PMID   17322056. S2CID   10374218. Archived from the original (PDF) on 2009-10-07.
    "Supporting Online Material" (PDF). Archived from the original (PDF) on 2009-03-26.
  9. D. Zorin. Subdivisions on arbitrary meshes: algorithms and theory . Institute of Mathematical Sciences (Singapore) Lecture Notes Series. 2006.
  10. Perelman, Grisha (11 November 2002). "The entropy formula for the Ricci flow and its geometric applications". arXiv: math.DG/0211159 .
  11. Perelman, Grisha (10 March 2003). "Ricci flow with surgery on three-manifolds". arXiv: math.DG/0303109 .
  12. Perelman, Grisha (17 July 2003). "Finite extinction time for the solutions to the Ricci flow on certain three-manifolds". arXiv: math.DG/0307245 .
  13. 1 2 J. W. Cannon and E. L. Swenson, Recognizing constant curvature discrete groups in dimension 3. Transactions of the American Mathematical Society 350 (1998), no. 2, pp. 809849.