# Quantum v4.32: finite ideal repeater chain Local development over `6493e45b7bb78ba41ac732b0f166988c58dd7b2b`. The published Leanbook 1.0.0 tag and public main are unchanged. ## Concrete scope The repeater is a homogeneous chain of 2^k elementary segments, with ideal operations and independent initial Werner resources of visibility w0 in [0,1]. Each level performs one swapping step and exactly one BBPSSW purification round. The two purification inputs are identically distributed, so this is the diagonal case of the heterogeneous protocol, not a claim about arbitrary unequal network links. The existing ideal acceptedMap acts on M tensor N to define pairSwap. Four independent child resources A,B,C,D feed a node: repeaterNode(A,B,C,D) = purified(pairSwap(A,B) tensor pairSwap(C,D)). The recursive all-success matrix uses four independently prepared copies of the previous level's resource. No conditional division is performed inside this construction. Tensor products denote independent resources, not a cloning channel. The node expression is multilinear in four inputs; using one common parameter for the copies does not make it a linear CP map of a single pair. ## Operator refinement and probability The previous circuit theorems give exact matrix identities for pairSwap and the purification node. Induction proves, at every finite depth, D_k = p_k isotropic(w_k), w_(k+1) = 2 w_k^2 (1+2w_k^2) / (3(1+w_k^4)), p_0 = 1, p_(k+1) = p_k^4 (1+w_k^4)/2. The visibility remains in [0,1]. Each level's conditional acceptance probability (1+w_k^4)/2 is in [1/2,1]. The total all-success weight p_k is strictly positive, at most one, and equals the complex trace of D_k. The exact closed form uses product_(j