Self-similar metric inverse limits of invariant geometric inverse sequences (Q1206532)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Self-similar metric inverse limits of invariant geometric inverse sequences
scientific article

    Statements

    Self-similar metric inverse limits of invariant geometric inverse sequences (English)
    0 references
    0 references
    1 April 1993
    0 references
    Let \((X,d)\) be a metric space and \(A_ \Phi\) the unique invariant subset of \(X\) which is generated by the family \(\Phi=\{\varphi_ 1,\dots,\varphi_ m\}\) of contractions of \(X\). \(\Omega_ \infty\) denotes the space of addresses, \(\pi: \Omega_ \infty\to A\) the coding function. A metric space \(M\) is said to be a better model for \(A_ \Phi\) iff \[ \Omega_ \infty\overset\rho\longrightarrow M\overset {h}\longrightarrow A_ \Phi, \] where \(\rho\), \(h\) are some natural continuous surjective functions such that \(\pi=h\circ\rho\). Such a metric space \(M\) can be found by using invariant inverse sequences \({\mathbf A}=(A^ n,p^{n+1}_ n)\) and \(M\) as the inverse limit of \({\mathbf A}\) if the so-called sieve condition is satisfied. In the case of similarities \(\varphi_ i\) for \(i=1,\dots,m\) in an Euclidean space the sequence \({\mathbf A}\) can be chosen such that the inverse limit becomes the best model and every \(A^ n\) is a finite union of arcs of finite length provided that 1. the open set condition is satisfied for an open connected set \(U\), 2. \(\Phi\) satisfies the nesting axiom \((A_ \Phi\) is finitely ramified).
    0 references
    0 references
    fractals
    0 references
    self-similarity
    0 references
    space of addresses
    0 references
    coding function
    0 references
    invariant inverse sequences
    0 references
    inverse limit
    0 references
    sieve condition
    0 references
    open set condition
    0 references
    nesting axiom
    0 references
    finitely ramified
    0 references
    0 references
    0 references
    0 references
    0 references