Let A bound the total coefficient norm of a cleared replacement row delta*P(T). At t<=Q, replacing T by t+z increases this norm by at most (Q+1)^R. The corrected input uses three such row evaluations, so its cleared norm is at most 3A*(Q+1)^R. Put B0=max(delta,3A*(Q+1)^R). If an integer factor has coefficient norm S and chosen degree bound d_f, then clearing it by delta^d_f gives norm at most S*B0^d_f: each monomial of degree u contributes at most delta^(d_f-u)*B0^u<=B0^d_f. Truncation cannot increase this bound. Its logarithm is polynomially bounded when the explicit factor descriptions, degrees and layout parameters are polynomially bounded.