Special FunctionsReading edition

Recovering dilation parameters

Reading tools
Reading libraryInspect Lean
Switch work

Saved reading

Read side by side

Start reading

Resources & source

Read and explore

Proofs and implementation

About this work

Other resources

Original TeX with line links

Skip contents and start reading

A quantitative compact-continuity law

Fix the contractions and let \(h,g\) be two normalized nonnegative tap vectors. Set \(Q=\max_j\max(q_j,r_j)<1\) and \(d=\|h-g\|_1\). Then

\[ \boxed{\sup_{|z|\le R}|F_h(z)-F_g(z)| \le\frac{d}{4}\,[R f_Q'(R)-f_Q(R)].} \]

The right side is an explicitly defined entire majorant. It measures local sensitivity without asserting continuity of the asymptotic growth order.

Computed weak-tap differences lie below the proved compact bound. For a slow/faster two-channel bank, d=2 varepsilon , so the envelope is varepsilon [R f 3/4 '(R)-f 3/4 (R)]/2.
Computed weak-tap differences lie below the proved compact bound. For a slow/faster two-channel bank, \(d=2\varepsilon\), so the envelope is \(\varepsilon[R f_{3/4}'(R)-f_{3/4}(R)]/2\).

View full-size figure (new tab)

Each \(c_n(h)\) is a positive polynomial homogeneous of degree \(n\) in the weights. Coefficientwise comparison gives \(c_n(h)\le d_n(Q)(\sum_jh_j)^n\), where \(f_Q=\sum_nd_n(Q)z^{2n+1}\). Every weight partial derivative on the simplex lies in \([0,nd_n(Q)]\). The positive and negative parts of \(h-g\) each have mass \(d/2\), giving \(|c_n(h)-c_n(g)|\le(d/2)nd_n(Q)\). Summing this inequality uses \(\sum_nnd_n(Q)R^{2n+1}=[Rf_Q'(R)-f_Q(R)]/2\).

An analytic family with a discontinuous invariant

For fixed finite \(J\), allow complex \(h_j,q_j,r_j\), with \(|q_j|,|r_j|<1\). The coefficient recurrence defines polynomials in all these parameters. On a compact parameter set choose \(Q<1\) and \(W>0\) such that \(|q_j|,|r_j|\le Q\) and \(\sum_j|h_j|\le W\). Then

\[ |c_n(h,q,r)|\le W^n d_n(Q), \qquad \sum_n|c_n|R^{2n+1}\le W^{-1/2}f_Q(\sqrt W R). \]

Normal convergence proves joint holomorphic dependence on parameters and argument throughout this domain. Signed and complex banks have entire solutions, but the positive-bank growth theorem is not asserted for them.

The weak-tap example now has both sides quantified

For the bank with scales \((1/4,1/4)\) and \((3/4,3/4)\), weights \(1-\varepsilon,\varepsilon\), the functions converge on every compact set as \(\varepsilon\downarrow0\). The preceding envelope gives a linear bound in \(\varepsilon\). At every \(\varepsilon>0\), the order is \(\log2/\log(4/3)\), while at zero it is \(1/2\).

The new lower-type theorem does not contradict this: its lower constant depends on the active faster weight and can tend to zero as that channel vanishes. For \(\varepsilon=10^{-3}\) one constructive lower constant is about \(1.4496\times10^{-9}\); a conservative upper constant is about \(90.4392\).

Identifying a bank has unavoidable equivalences

Permuting channels, swapping the scales within a channel, or merging duplicate scale pairs by adding their weights leaves the function unchanged. The two-scale single-channel inverse is exact up to swapping. A general minimal-bank identifiability theorem beyond these equivalences is not proved.

The resulting research target is specific: determine optimal growth type, possible logarithmic oscillations, and minimal-bank identifiability. A finite plot cannot settle any of those questions.

Source and conversion record

This HTML edition follows the retained manuscript. It adds no proof review or Lean coverage.

Source identities and equation checks

Notation in Special Functions

Look up a symbol without leaving this chapter. Select text before opening help to search for it.

Search this work’s notation.

    Symbols can have different meanings in different passages. Read each result in its own context.

    Open the full notation index