Replication Descent and -Finality of Replicable Functions
Eric Culf, Abdellah Sebbar
Source abstract
We show that replication carries congruence symmetry down an explicit level tower. If a normalized replicable function , holomorphic on the upper half-plane, is invariant under , then its th replicate is invariant under . Thus every replicate whose index is divisible by is the normalized modular invariant . This gives a direct and classification-free proof of -finality for congruence-invariant replicable functions. The argument uses only the replication identities and an elementary generation theorem for congruence subgroups; it requires neither complete replicability nor arithmetic hypotheses on the Fourier coefficients. We then apply the descent law to completely replicable functions of finite replication order. Their replication towers have a canonical terminal replicate, and the only possible terminal functions are , , and . Moreover, a finite-order completely replicable function is -final precisely when its terminal replicate is , and any symmetry beyond translations forces this alternative.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.