证明
Lemma 6 ([Lift counts and their dual obstruction]). For every finite simple…Lemma 4. The round-two color histogram in joint k -WL determines (T_ k+1 ,X) .…观点
Given a successful choice (d_i)_ i∈[t] , map main vertex i to (i,d_i) and each h_ ij;ℓ to (h_ ij;ℓ ,λ_ ij ^i(d_i)) . The common pair label and the unrestricted edge toward ℓ make this a homomorphism φ:T→G with τφ the identity. Set every vertex and edge weight to one. Each vertex of T has exactly one neighbor of each adjacent type, and exactly one source vertex has type 1 , so holds. Apply Lemma 6 ([Lift counts and their dual obstruction]) and then Lemma 4.