Loop Groups and Discrete KdV Equations

Jeremy Schiff

Abstract. A study of fully discretized lattice equations associated with the KdV hierarchy is presented. Loop group methods give a systematic way of constructing discretizations of the equations in the hierarchy. The lattice KdV system of Nijhoff et al arises from the lowest order discretization of the trivial, lowest order equation in the hierarchy, b_t=b_x. Two new discretizations are also given, the lowest order discretization of the first nontrivial equation in the hierarchy, and a `second order' discretization of b_t=b_x. The former, which is given the name full lattice KdV, has the (potential) KdV equation as a standard continuum limit. For each discretization a Backlund transformation is given and the soliton content is analysed. The full lattice KdV system has, like KdV itself, solitons of all speeds, whereas both other discretizations studied have a limited range of speeds (being discretizations of an equation with solutions only of a fixed speed).