Indexed metadata

Replication Descent and JJ-Finality of Replicable Functions

Eric Culf, Abdellah Sebbar

Source record

Source: arXiv

Published: Sep 8, 2026

arXiv: 2609.08243

Open original source ↗

Source abstract

We show that replication carries congruence symmetry down an explicit level tower. If a normalized replicable function ff, holomorphic on the upper half-plane, is invariant under Γ0(N)Γ_0(N), then its nnth replicate is invariant under Γ0(N/(N,n))Γ_0(N/(N,n)). Thus every replicate whose index is divisible by NN is the normalized modular invariant J=j744J=j-744. This gives a direct and classification-free proof of JJ-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 JJ, q1q^{-1}, and q1+qq^{-1}+q. Moreover, a finite-order completely replicable function is JJ-final precisely when its terminal replicate is JJ, 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.