lemma

Lemma 5.6

chunk recursion

Lemma 5.6 (chunk recursion). Let PP be a nonempty even palindrome with suffix link L=λ(P)L=\lambda(P), bridge bb, and bridge block BPB_P. Then Db(P)=L,ωb(P)=BP,D_b(P)=L,\qquad \omega_b(P)=B_P, and for every letter a≠ba\ne b, Da(P)=Da(L),ωa(P)=ωa(L) b BP,D_a(P)=D_a(L),\qquad \omega_a(P)=\omega_a(L)\,b\,B_P, with the same definedness on both sides (for L=ϵL=\epsilon the right-hand sides are undefined).