Iterated Graph Systems (II): Bernoulli percolation and critical-exponent universality classes on hierarchical lattices
Hauser and Saxena (1986) questioned whether dimension-based universality holds for percolation on hierarchical lattices. A related conjecture holds that lattices in the same critical-exponent universality class must have commensurate discrete renormalisation scales.
Bernoulli percolation is studied on hierarchical lattices generated by edge iterated graph systems. Critical clusters are represented as random EIGS, and eight critical exponents are analysed. Four of them define a universality class, and that class is characterised by three critical dimensions. The six exponentials theorem gives number-theoretic commensurability criteria, and explicit Wheatstone-based rule graphs are built with integer certificates. The results are formalized in Lean 4 on Mathlib.
No finite family of substitution-multiplicative dimensions determines the universality class, which settles the Hauser–Saxena question rigorously. The commensurability conjecture is disproved: one universality class is shown to contain infinitely many pairwise incommensurate scales. The proofs are checked by Lean's kernel with no proof placeholders.
