C3.8N candidate theorem

Statistical PN.2 extension

Branch hiddenness is parameterized by overlap of the available-data distributions, in addition to the absence of a label b.

Statistical PN.2 · rigorous audit

C3.8T: the candidate bound is verified under explicit assumptions. A full proof, sharp examples and counterexamples are available. The canonical patch has not been applied.

Open the rigorous audit

τ(u)=TV(P_L^u,P_R^u)

R_S ≥ ½Δ_S(1−τ), R_D ≥ ½Δ_D(1−τ)

R_R ≥ ½‖K‖(1−τ)

R_SR_D ≥ ¼Δ_SΔ_D(1−τ)²

R_RR_D ≥ ¼‖K‖Δ_D(1−τ)²

Status: C3.8N-CANDIDATE-THEOREM · not yet canonical. At τ=0 the deterministic form is recovered; at τ=1 the lower bound vanishes.