Conditional partner counts for single-cycle weld completions
ProvedWeldedPath.single_cycle_completion_countLet be a valid properly three-colored welded-tree instance, with even and . Let be the finite set of edge permutations preserving the allowed edge classes whose permuted weld is a single cycle. Fix any set of exposed input edges and any reference permutation . Put
For a weld edge , let be the weld edges of the same color as , and put . Then, for every target edge ,
For and , this is precisely the conditional partner bound . The formal statement uses natural-number counts and truncated subtraction, so empty conditioning fibers and singleton residual classes require no separate hypotheses. A recorded or wrong-class target has zero count by injectivity or class preservation. Conditioning on nonweld records is allowed: those independent class-permutation coordinates do not affect the cycle condition.
The statement is solely a finite completion count. It asserts no coupling, random process, quantum claim, or path distribution. Counting is over colored edge permutations, not over their uncolored graph images.
import Definitions.Def_WeldedPath_successProb import Definitions.Def_FinitePermutationCoupling_BlockModel set_option autoImplicit false
namespace WeldedPath
open Classical FinitePermutationCoupling
/-- The static conditional completion count underlying equation (76) in the
proof of Lemma 4.13, arXiv:2611.05912v1, Section 4.4. The factor uses truncated
natural subtraction, so empty fibers and one remaining partner are included.
No stochastic process, coupling, or path law is asserted here. -/
theorem single_cycle_completion_count :
∀ n l : ℕ, Even n → 2 ≤ l → l ≤ n - 4 →
∀ G : WeldedInstance n, G.IsValid →
∀ (D : Finset G.edges) (h : Equiv.Perm G.edges) (e z : G.edges),
e.1 ∈ G.weldEdges → e ∉ D →
(((Finset.univ.filter fun f : G.edges =>
f.1 ∈ G.weldEdges ∧ G.color f.1 = G.color e.1) \ D).card - 1) *
((exposedFiber
((Finset.univ.filter (G.IsEdgePerm l)).filter G.SingleCycle) D h).filter
fun π => π e = z).card ≤
(exposedFiber
((Finset.univ.filter (G.IsEdgePerm l)).filter G.SingleCycle) D h).card := by
sorry
end WeldedPath