Multiplicative Composition Lower Bounds via Information Complexity in Circuit Complexity — E8 Intelligence Research

FINDING: The KRW conjecture seeks to prove that circuit complexity composes multiplicatively under function composition — i.e., the complexity of \(f ∘ g\) is at least the product of their individual complexities, a structural lower-bound principle for Boolean circuits. | MATH: The conjecture states \(D(f ∘ g) ≈ D(f) + D(g)\) for depth, but the stronger form for size/complexity is \(C(f ∘ g) ≥ C(f) · C(g)\) (up to logarithmic factors). Key tool: *information complexity* — \(IC(f ∘ g) ≥ IC(f) · IC(g)\) under product distributions. Lifting theorems map communication complexity lower bounds to circuit lower bounds: \(CC(f ∘ Index) ≥ CC(f) · log n\). | CONNECTION: The multiplicative structure mirrors the golden-ratio-like scaling in self-similar compositions — if \(C(f)=a\), then \(C(f∘ k) ≥ a^k\), echoing exponential growth rates tied to \(1.618^k\) in optimal recursive partitions. The "strong composition" variant (Meir 2024 Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com