First-Order Linear PDEs and the Method of Characteristics

Suppose smoke drifts across a room, carried by a steady wind. Slow dispersion is ignored, so only transport matters. How does the smoke's concentration at one point relate to its concentration somewhere else entirely? This is the essence of a first-order linear partial differential equation (PDE). It expresses a conservation law for a quantity being carried, or advected, along a velocity field. The remarkable fact — the reason this topic anchors the entire study of PDEs — is striking. Such equations, despite involving a function of several variables, secretly reduce to ordinary differential equations. This reduction happens along special paths called characteristic curves. This reduction is not a trick restricted to one example. It is a structural theorem about the equation itself. Once we know the characteristics, the PDE becomes a statement about constancy. The unknown function is constant (or evolves by a known ODE) along each curve. The entire two- or higher-dimensional problem collapses into a family of one-dimensional problems glued together. This is the same idea that powers the Method of Characteristics for Quasilinear PDEs. It underlies the analysis of transport equations, traffic flow models, and the propagation of signals in wave equations. The big picture is this: a first-order linear PDE prescribes a direction field in the space of independent variables. In general, it also gives a rule for how the unknown changes along that direction. Solving the PDE means integrating that direction field to find the characteristic curves. We then use the initial or boundary data — the Cauchy data — to pin down the constant of integration on each curve. The geometry of where the data curve meets the characteristics matters greatly. It decides whether the solution exists, is unique, or fails to be well-posed at all. This offers a preview of the deeper theme of Well-Posedness of PDE Problems. This article builds the method from the ground up. It gives a precise definition of the general first-order linear PDE. It provides a full derivation via the chain rule connecting the PDE to a system of ODEs. It states a rigorous existence-uniqueness theorem for the Cauchy problem under a transversality condition. It also offers two asymmetric worked examples. Finally, it presents a counterexample showing exactly what goes wrong when transversality fails.

Key takeaways
  • A first-order linear PDE has the form a(x,y)ux+b(x,y)uy+c(x,y)u=f(x,y)a(x,y)u_x + b(x,y)u_y + c(x,y)u = f(x,y), linear in uu and its first derivatives.
  • Characteristic curves are integral curves of the vector field (a,b)(a,b): solving dx/dt=adx/dt = a, dy/dt=bdy/dt = b turns the PDE into an ODE for uu along each curve.
  • Along a characteristic, the PDE becomes du/dt=f−cudu/dt = f - cu, a linear first-order ODE solvable by standard methods (Integrating Factor Method).
  • The Cauchy problem prescribes uu on a curve Γ\Gamma; a unique local solution exists provided Γ\Gamma is nowhere tangent to the characteristics (transversality).
  • If Γ\Gamma is itself a characteristic, the Cauchy data must be compatible with the PDE, and solutions either fail to exist or are wildly non-unique.
  • The method generalizes directly to the quasilinear case, where a,b,c,fa,b,c,f are allowed to depend on uu itself.
  • Key idea: a first-order linear PDE is a family of ODEs in disguise, one ODE running along each characteristic curve.

Where this lives today

The method of characteristics is the entry point to the entire theory of first-order PDEs and to hyperbolic PDEs more broadly. In fluid dynamics and gas dynamics, the (nonlinear, quasilinear) analogue of this method — see Quasilinear PDEs and Characteristic Curves — governs shock formation in the Burgers equation and traffic-flow models. In geometric optics, the eikonal equation (a nonlinear first-order PDE for the phase of a wave) is solved by characteristic "light rays," directly generalizing this construction. In control theory, the Hamilton–Jacobi–Bellman equation is solved along characteristic trajectories that are optimal control paths. In numerical analysis, characteristics underlie the CFL condition and semi-Lagrangian schemes for advection-dominated PDEs, where grid points are transported along approximate characteristic paths rather than updated by finite differences alone. In probability, the Kolmogorov forward/backward equations for pure-drift (no-diffusion) Markov processes reduce, via characteristics, to deterministic ODE flows — the bridge from PDEs to stochastic processes. Finally, this article's transversality condition is the seed of the general theory of Well-Posedness of PDE Problems, including the celebrated Cauchy–Kovalevskaya theorem for more general systems.

Ask the tutor: How does this characteristic-curve method change when the coefficients a,b,c,fa, b, c, f are allowed to depend on the unknown uu itself, as in the quasilinear case?

DefinitionFirst-order linear PDE and the Cauchy problem

Let D⊂R2D \subset \mathbb{R}^2 be an open set and let a,b,c,f:D→Ra, b, c, f : D \to \mathbb{R} be continuously differentiable functions with (a(x,y),b(x,y))≠(0,0)(a(x,y), b(x,y)) \neq (0,0) for all (x,y)∈D(x,y) \in D. A first-order linear partial differential equation for an unknown function u:D→Ru : D \to \mathbb{R} is an equation of the form

a(x,y) ux(x,y)+b(x,y) uy(x,y)+c(x,y) u(x,y)=f(x,y),(x,y)∈D.a(x,y)\, u_x(x,y) + b(x,y)\, u_y(x,y) + c(x,y)\, u(x,y) = f(x,y), \qquad (x,y)\in D.

The equation is called linear because uu and its partial derivatives ux,uyu_x, u_y appear only to the first power and are not multiplied together; the coefficients a,b,ca,b,c depend only on (x,y)(x,y), never on uu. (When a,b,ca,b,c or ff are allowed to depend on uu itself, the equation is called quasilinear, treated in Quasilinear PDEs and Characteristic Curves.) A Cauchy problem consists of the PDE together with data prescribed on a curve: given a smooth curve Γ⊂D\Gamma \subset D parametrized by s↦(x0(s),y0(s))s \mapsto (x_0(s), y_0(s)) and a function g(s)g(s), we seek u∈C1(D)u \in C^1(D) solving the PDE with

u(x0(s),y0(s))=g(s)for all s in the parameter interval.u(x_0(s), y_0(s)) = g(s) \quad \text{for all } s \text{ in the parameter interval.}

The characteristic curves of the PDE are the integral curves of the vector field (a,b)(a,b), i.e. solutions (x(t),y(t))(x(t), y(t)) of the autonomous system

dxdt=a(x,y),dydt=b(x,y).\frac{dx}{dt} = a(x,y), \qquad \frac{dy}{dt} = b(x,y).

Intuition

Picture the plane DD filled with a vector field (a(x,y),b(x,y))(a(x,y), b(x,y)), like arrows showing wind direction at every point. The characteristic curves are the trajectories a leaf would follow if dropped into that wind — they are exactly the flow lines of the vector field, found by solving dx/dt=adx/dt = a, dy/dt=bdy/dt = b as you would any first-order ODE system. Now watch what the PDE says about uu along one of these flow lines. If (x(t),y(t))(x(t), y(t)) is a characteristic curve, the chain rule gives

ddtu(x(t),y(t))=uxdxdt+uydydt=ux a+uy b.\frac{d}{dt} u(x(t), y(t)) = u_x \frac{dx}{dt} + u_y \frac{dy}{dt} = u_x \, a + u_y \, b.

But the left side of the PDE is exactly aux+buya u_x + b u_y, so along the characteristic,

ddtu(x(t),y(t))=f(x(t),y(t))−c(x(t),y(t)) u(x(t),y(t)).\frac{d}{dt} u(x(t),y(t)) = f(x(t),y(t)) - c(x(t),y(t))\, u(x(t),y(t)).

This is a genuine ODE in the single variable tt, with uu evaluated along the curve playing the role of the unknown. The two-variable PDE has been sliced into a one-parameter family of one-variable ODEs, one for each characteristic curve threading through DD. Solving the PDE is now a two-step process: find the characteristics (geometry), then solve the ODE along each one (analysis), then use the data on Γ\Gamma to fix the constant of integration for each curve individually. The picture below shows a vector field, one characteristic curve threading through it, and a transversal data curve Γ\Gamma crossing every characteristic exactly once — the geometric condition that makes the Cauchy problem well-posed.

Figure
Characteristic curves as flow lines of (a,b)(a,b), crossed transversally by data curve Γ\Gamma
x y characteristic (x(t),y(t)) Γ: data u = g(s) (x₀(s), y₀(s))

The central theorem

TheoremLocal existence and uniqueness for the linear Cauchy problem

Let D⊂R2D \subset \mathbb{R}^2 be open, let a,b,c,f∈C1(D)a,b,c,f \in C^1(D) with (a,b)≠(0,0)(a,b) \neq (0,0) on DD, and let Γ⊂D\Gamma \subset D be a C1C^1 curve parametrized by an injective map

s↦(x0(s),y0(s)),s∈I⊂R an open interval,s \mapsto (x_0(s), y_0(s)), \qquad s \in I \subset \mathbb{R} \text{ an open interval},

with (x0′(s),y0′(s))≠(0,0)(x_0'(s), y_0'(s)) \neq (0,0) for all ss. Let g∈C1(I)g \in C^1(I) be given Cauchy data. Suppose the transversality condition holds: for every s∈Is \in I,

J(s):=a(x0(s),y0(s)) y0′(s)−b(x0(s),y0(s)) x0′(s)≠0.J(s) := a(x_0(s), y_0(s))\, y_0'(s) - b(x_0(s), y_0(s))\, x_0'(s) \neq 0.

Then there exists an open neighborhood Ω⊂D\Omega \subset D of Γ\Gamma and a unique function u∈C1(Ω)u \in C^1(\Omega) satisfying

aux+buy+cu=f in Ω,u(x0(s),y0(s))=g(s) for s∈I.a u_x + b u_y + c u = f \text{ in } \Omega, \qquad u(x_0(s), y_0(s)) = g(s) \text{ for } s \in I.
Proof

Step 1 — Set up characteristic coordinates. Fix s∈Is \in I. Consider the initial value problem for the characteristic system

dxdt=a(x,y),dydt=b(x,y),x(0)=x0(s), y(0)=y0(s).\frac{dx}{dt} = a(x,y), \qquad \frac{dy}{dt} = b(x,y), \qquad x(0) = x_0(s),\ y(0) = y_0(s).

Since a,b∈C1(D)a, b \in C^1(D), they are locally Lipschitz, so by the Picard–Lindelöf existence–uniqueness theorem for First-Order ODEs (Peano existence plus Lipschitz uniqueness), there is ε(s)>0\varepsilon(s) > 0 and a unique C1C^1 solution

t↦(X(t,s),Y(t,s)),t∈(−ε(s),ε(s)),t \mapsto \big(X(t,s), Y(t,s)\big), \qquad t \in (-\varepsilon(s), \varepsilon(s)),

depending continuously — in fact C1C^1-jointly, by smooth dependence of ODE solutions on initial conditions, since a,b∈C1a,b \in C^1 — on the parameter ss. By standard compactness arguments (covering a compact subinterval [s1,s2]⊂I[s_1,s_2] \subset I by finitely many such neighborhoods), ε\varepsilon may be taken to be a single positive constant ε0\varepsilon_0 on any compact subinterval, and (X,Y)(X,Y) is jointly C1C^1 on a set (−ε0,ε0)×[s1,s2](-\varepsilon_0,\varepsilon_0) \times [s_1,s_2].

Step 2 — The map (t,s)↦(X,Y)(t,s) \mapsto (X,Y) is a local diffeomorphism. Compute the Jacobian of (t,s)↦(X(t,s),Y(t,s))(t,s) \mapsto (X(t,s), Y(t,s)) at t=0t = 0:

∂(X,Y)∂(t,s)∣t=0=det⁡(Xt(0,s)Xs(0,s)Yt(0,s)Ys(0,s))=det⁡(a(x0(s),y0(s))x0′(s)b(x0(s),y0(s))y0′(s)),\frac{\partial(X,Y)}{\partial(t,s)}\Big|_{t=0} = \det \begin{pmatrix} X_t(0,s) & X_s(0,s) \\ Y_t(0,s) & Y_s(0,s) \end{pmatrix} = \det\begin{pmatrix} a(x_0(s),y_0(s)) & x_0'(s) \\ b(x_0(s),y_0(s)) & y_0'(s) \end{pmatrix},

using Xt(0,s)=a(x0(s),y0(s))X_t(0,s) = a(x_0(s),y_0(s)), Yt(0,s)=b(x0(s),y0(s))Y_t(0,s) = b(x_0(s),y_0(s)) (from the ODE itself at t=0t=0) and Xs(0,s)=x0′(s)X_s(0,s) = x_0'(s), Ys(0,s)=y0′(s)Y_s(0,s) = y_0'(s) (from differentiating the initial condition X(0,s)=x0(s)X(0,s)=x_0(s), Y(0,s)=y0(s)Y(0,s) = y_0(s) with respect to ss). This determinant equals

a(x0(s),y0(s)) y0′(s)−x0′(s) b(x0(s),y0(s))=J(s),a(x_0(s),y_0(s))\, y_0'(s) - x_0'(s)\, b(x_0(s),y_0(s)) = J(s),

which is nonzero by the transversality hypothesis. By continuity of the Jacobian (all entries are C1C^1, hence continuous), the Jacobian remains nonzero in a neighborhood of (0,s)(0,s) for each ss; by compactness of [s1,s2][s_1,s_2], it is bounded away from 00 on a common neighborhood (−δ,δ)×[s1,s2](-\delta,\delta)\times[s_1,s_2] for some δ∈(0,ε0]\delta \in (0,\varepsilon_0]. By the Inverse Function Theorem, the map Φ(t,s)=(X(t,s),Y(t,s))\Phi(t,s) = (X(t,s), Y(t,s)) is a C1C^1 diffeomorphism from (−δ,δ)×(s1,s2)(-\delta,\delta)\times (s_1,s_2) (shrunk slightly if necessary to be open) onto its image Ω⊂D\Omega \subset D, an open set containing the piece of Γ\Gamma over (s1,s2)(s_1,s_2). Let (t(x,y),s(x,y))(t(x,y), s(x,y)) denote the C1C^1 inverse map Φ−1\Phi^{-1} on Ω\Omega.

Step 3 — Reduce the PDE to an ODE in tt for fixed ss. Define, for a candidate solution uu, the pullback v(t,s):=u(X(t,s),Y(t,s))v(t,s) := u(X(t,s), Y(t,s)). By the chain rule,

vt(t,s)=ux(X,Y) Xt+uy(X,Y) Yt=ux(X,Y) a(X,Y)+uy(X,Y) b(X,Y).v_t(t,s) = u_x(X,Y)\, X_t + u_y(X,Y)\, Y_t = u_x(X,Y)\, a(X,Y) + u_y(X,Y)\, b(X,Y).

If uu solves the PDE at (X,Y)(X,Y), the right-hand side equals f(X,Y)−c(X,Y)u(X,Y)=f(X,Y)−c(X,Y)v(t,s)f(X,Y) - c(X,Y)u(X,Y) = f(X,Y) - c(X,Y) v(t,s). Hence uu solves the PDE on Ω\Omega if and only if, for each fixed ss, v(⋅,s)v(\cdot, s) solves the linear ODE

∂v∂t(t,s)+c(X(t,s),Y(t,s)) v(t,s)=f(X(t,s),Y(t,s)),t∈(−δ,δ).(∗)\frac{\partial v}{\partial t}(t,s) + c(X(t,s),Y(t,s))\, v(t,s) = f(X(t,s), Y(t,s)), \qquad t \in (-\delta,\delta). \tag{$\ast$}

This equivalence is exact: the chain-rule computation used no approximation, only Φ\Phi being C1C^1 with C1C^1 inverse, which Step 2 guarantees.

Step 4 — Solve the ODE and impose the Cauchy data. Equation (∗)(\ast) is a first-order linear ODE in tt with continuous coefficients c(X(t,s),Y(t,s))c(X(t,s),Y(t,s)) and f(X(t,s),Y(t,s))f(X(t,s),Y(t,s)) (continuous since X,YX,Y are C1C^1 and c,f∈C1⊂C0c,f \in C^1 \subset C^0). By the Integrating Factor Method, define

μ(t,s)=exp⁡(∫0tc(X(τ,s),Y(τ,s)) dτ)>0.\mu(t,s) = \exp\left(\int_0^t c(X(\tau,s),Y(\tau,s))\, d\tau\right) > 0.

Then (∗)(\ast) is equivalent to ∂t(μv)=μf(X,Y)\partial_t(\mu v) = \mu f(X,Y), so the unique solution with prescribed value v(0,s)v(0,s) is

v(t,s)=1μ(t,s)[v(0,s)+∫0tμ(τ,s) f(X(τ,s),Y(τ,s)) dτ].(∗∗)v(t,s) = \frac{1}{\mu(t,s)}\left[ v(0,s) + \int_0^t \mu(\tau,s)\, f(X(\tau,s),Y(\tau,s))\, d\tau \right]. \tag{$\ast\ast$}

The Cauchy condition requires v(0,s)=u(X(0,s),Y(0,s))=u(x0(s),y0(s))=g(s)v(0,s) = u(X(0,s),Y(0,s)) = u(x_0(s),y_0(s)) = g(s). Substituting v(0,s)=g(s)v(0,s) = g(s) into (∗∗)(\ast\ast) determines v(t,s)v(t,s) uniquely for every (t,s)(t,s), because the integrating factor method gives the unique solution of a linear ODE with a given initial value — this is precisely the existence–uniqueness theorem for linear first-order ODEs, which requires no further hypothesis beyond continuity of the coefficients (already established).

Step 5 — Transfer back to (x,y)(x,y) coordinates. Define u(x,y):=v(t(x,y),s(x,y))u(x,y) := v(t(x,y), s(x,y)) for (x,y)∈Ω(x,y) \in \Omega, using the inverse map from Step 2. Since vv is C1C^1 in (t,s)(t,s) (as X,Y,μ,f,cX, Y, \mu, f, c are all C1C^1 or continuous with C1C^1 dependence built from C1C^1 ODE flows) and (t,s)=Φ−1(x,y)(t,s) = \Phi^{-1}(x,y) is C1C^1, u∈C1(Ω)u \in C^1(\Omega) by the chain rule for compositions of C1C^1 maps. By construction (Step 3, run in reverse — the equivalence was an "if and only if"), uu solves the PDE at every point of Ω\Omega, because every point of Ω\Omega is Φ(t,s)\Phi(t,s) for a unique (t,s)(t,s), and v(t,s)v(t,s) solves (∗)(\ast) by construction. By Step 4, uu satisfies the Cauchy data on Γ∩Ω\Gamma \cap \Omega.

Step 6 — Uniqueness. Suppose u~∈C1(Ω)\tilde u \in C^1(\Omega) is any other solution of the same PDE and Cauchy data. Define v~(t,s)=u~(X(t,s),Y(t,s))\tilde v(t,s) = \tilde u(X(t,s), Y(t,s)). By Step 3 (the forward direction of the equivalence), v~(⋅,s)\tilde v(\cdot,s) solves the same ODE (∗)(\ast) for each ss, with the same initial value v~(0,s)=u~(x0(s),y0(s))=g(s)\tilde v(0,s) = \tilde u(x_0(s),y_0(s)) = g(s). By uniqueness of solutions to linear ODEs (Step 4), v~(t,s)=v(t,s)\tilde v(t,s) = v(t,s) for all (t,s)(t,s). Since Φ\Phi is a bijection (−δ,δ)×(s1,s2)→Ω(-\delta,\delta)\times(s_1,s_2) \to \Omega, this forces u~(x,y)=u(x,y)\tilde u(x,y) = u(x,y) for every (x,y)∈Ω(x,y) \in \Omega. Hence uu is the unique C1C^1 solution on Ω\Omega. ■\blacksquare

∎

Worked examples

Example 1 (variable coefficients, asymmetric data). Solve

x ux+uy=x2,u(x,0)=x3,x>0,x\, u_x + u_y = x^2, \qquad u(x, 0) = x^3, \quad x > 0,

on the region x>0x>0. Here a(x,y)=xa(x,y) = x, b(x,y)=1b(x,y)=1, c=0c=0, f(x,y)=x2f(x,y) = x^2. The data curve is Γ={(s,0):s>0}\Gamma = \{(s,0): s>0\} with x0(s)=sx_0(s)=s, y0(s)=0y_0(s)=0, g(s)=s3g(s)=s^3. Transversality check. J(s)=a y0′−b x0′=(s)(0)−(1)(1)=−1≠0J(s) = a\,y_0' - b\,x_0' = (s)(0) - (1)(1) = -1 \neq 0 for all s>0s>0, so the theorem applies and guarantees a unique local C1C^1 solution. Characteristics. Solve dx/dt=xdx/dt = x, dy/dt=1dy/dt = 1, with x(0)=sx(0)=s, y(0)=0y(0)=0. Then y(t)=ty(t) = t and x(t)=set=seyx(t) = s e^{t} = s e^{y}. Solving for ss: s=xe−ys = x e^{-y}. ODE along the characteristic. Since c=0c=0, along the curve du/dt=f=x(t)2=s2e2tdu/dt = f = x(t)^2 = s^2 e^{2t}. With u(0)=g(s)=s3u(0) = g(s) = s^3,

u(t)=s3+∫0ts2e2τ dτ=s3+s22(e2t−1).u(t) = s^3 + \int_0^t s^2 e^{2\tau}\, d\tau = s^3 + \frac{s^2}{2}\left(e^{2t}-1\right).

Back-substitute. Using t=yt = y and s=xe−ys = xe^{-y}:

u(x,y)=(xe−y)3+(xe−y)22(e2y−1)=x3e−3y+x22(1−e−2y).u(x,y) = (xe^{-y})^3 + \frac{(xe^{-y})^2}{2}\left(e^{2y}-1\right) = x^3 e^{-3y} + \frac{x^2}{2}\left(1 - e^{-2y}\right).

Verification. Compute ux=3x2e−3y+x(1−e−2y)u_x = 3x^2 e^{-3y} + x(1-e^{-2y}) and uy=−3x3e−3y+x2e−2yu_y = -3x^3 e^{-3y} + x^2 e^{-2y}. Then

xux+uy=3x3e−3y+x2(1−e−2y)−3x3e−3y+x2e−2y=x2(1−e−2y)+x2e−2y=x2,x u_x + u_y = 3x^3 e^{-3y} + x^2(1-e^{-2y}) - 3x^3 e^{-3y} + x^2 e^{-2y} = x^2(1-e^{-2y}) + x^2 e^{-2y} = x^2,

matching f=x2f = x^2. At y=0y=0: u(x,0)=x3⋅1+x22(1−1)=x3u(x,0) = x^3 \cdot 1 + \frac{x^2}{2}(1-1) = x^3, matching the data. Both checks confirm the solution.

Example 2 (nonzero cc, transport-reaction equation). Solve

ux+2uy+3u=ey,u(0,y)=y2,y∈R.u_x + 2u_y + 3u = e^{y}, \qquad u(0,y) = y^2,\quad y \in \mathbb{R}.

Here a=1a=1, b=2b=2, c=3c=3, f(x,y)=eyf(x,y)=e^y. Data curve: x0(s)=0x_0(s)=0, y0(s)=sy_0(s)=s, g(s)=s2g(s)=s^2. Transversality. J(s)=ay0′−bx0′=(1)(1)−(2)(0)=1≠0J(s) = a y_0' - b x_0' = (1)(1) - (2)(0) = 1 \neq 0 everywhere — a globally transversal line, so the theorem gives a solution on all of R2\mathbb{R}^2 here (the characteristics sweep out the whole plane). Characteristics. dx/dt=1, dy/dt=2dx/dt = 1,\, dy/dt = 2, x(0)=0, y(0)=sx(0)=0,\, y(0)=s. So x(t)=tx(t) = t, y(t)=2t+sy(t) = 2t + s, giving s=y−2xs = y - 2x. ODE along the characteristic. Along the curve, f(x(t),y(t))=e2t+sf(x(t),y(t)) = e^{2t+s}, so

dudt+3u=e2t+s.\frac{du}{dt} + 3u = e^{2t+s}.

Integrating factor μ=e3t\mu = e^{3t}: ddt(e3tu)=e3te2t+s=ese5t\dfrac{d}{dt}(e^{3t}u) = e^{3t}e^{2t+s} = e^{s}e^{5t}. Integrate:

e3tu(t)−u(0)=es⋅e5t−15  ⟹  u(t)=e−3tu(0)+es5(e2t−e−3t).e^{3t}u(t) - u(0) = e^{s}\cdot\frac{e^{5t}-1}{5} \implies u(t) = e^{-3t}u(0) + \frac{e^{s}}{5}\left(e^{2t} - e^{-3t}\right).

With u(0)=g(s)=s2u(0) = g(s) = s^2:

u(t)=s2e−3t+es5(e2t−e−3t).u(t) = s^2 e^{-3t} + \frac{e^s}{5}\left(e^{2t}-e^{-3t}\right).

Back-substitute t=xt = x, s=y−2xs = y-2x:

u(x,y)=(y−2x)2e−3x+ey−2x5(e2x−e−3x)=(y−2x)2e−3x+ey−ey−5x5.u(x,y) = (y-2x)^2 e^{-3x} + \frac{e^{y-2x}}{5}\left(e^{2x} - e^{-3x}\right) = (y-2x)^2 e^{-3x} + \frac{e^{y} - e^{y-5x}}{5}.

Verification. At x=0x=0: u(0,y)=y2⋅1+ey−ey5=y2u(0,y) = y^2\cdot 1 + \frac{e^y - e^y}{5} = y^2, matching the data exactly. Differentiating and substituting into ux+2uy+3uu_x + 2u_y + 3u (straightforward but tedious chain-rule bookkeeping) reproduces eye^y; the reader can confirm the eye^y term contributes ey+2ey+3⋅ey5⋅(… )e^y + 2e^y+3\cdot\frac{e^y}{5}\cdot(\dots) collapsing correctly because the particular solution ey5\frac{e^y}{5} alone already solves ux+2uy+3u=eyu_x+2u_y+3u=e^y when the transient −ey−5x5-\frac{e^{y-5x}}{5} term is annihilated by the operator (its characteristic exponent −5-5 matches 3+a(−2)⋅(rate)3 + a(-2)\cdot(\text{rate}) exactly by design of the integrating factor), and the homogeneous piece (y−2x)2e−3x(y-2x)^2e^{-3x} satisfies the homogeneous equation ux+2uy+3u=0u_x+2u_y+3u=0 since it is constant along characteristics up to the factor e−3xe^{-3x} decaying at rate matching c=3c=3.

CounterexampleWhy transversality cannot be dropped

Consider the same type of equation, ux+uy=0u_x + u_y = 0 (so a=b=1a=b=1, c=0c=0, f=0f=0), whose characteristics are the lines y−x=consty - x = \text{const}, along which uu is constant. Now pose Cauchy data on Γ={(s,s):s∈R}\Gamma = \{(s,s): s\in\mathbb{R}\}, i.e. x0(s)=s, y0(s)=sx_0(s)=s,\ y_0(s)=s, with data u(s,s)=g(s)u(s,s) = g(s). Check transversality: J(s)=a y0′−b x0′=(1)(1)−(1)(1)=0J(s) = a\,y_0' - b\,x_0' = (1)(1)-(1)(1) = 0 for every ss. The hypothesis of the theorem fails identically — Γ\Gamma is a characteristic curve. Consequence 1: no solution unless data is compatible. Since uu must be constant along every characteristic y−x=consty-x=\text{const}, and Γ\Gamma itself lies entirely on the single characteristic y−x=0y-x=0, the PDE forces uu to take one fixed value on all of Γ\Gamma. If we choose non-constant data, e.g. g(s)=sg(s) = s (so u(s,s)=su(s,s)=s), no C1C^1 solution can exist on any neighborhood of Γ\Gamma: any solution is constant on y=xy=x, contradicting u(s,s)=su(s,s)=s being non-constant. Consequence 2: infinitely many solutions if data happens to be constant. Suppose instead we choose the compatible data g(s)=7g(s) = 7 for all ss (matching the necessary constancy). Then every function of the form

u(x,y)=ϕ(y−x),ϕ∈C1(R), ϕ(0)=7,u(x,y) = \phi(y-x), \qquad \phi \in C^1(\mathbb{R}),\ \phi(0) = 7,

solves ux+uy=0u_x+u_y=0 (direct check: ux=−ϕ′(y−x)u_x = -\phi'(y-x), uy=ϕ′(y−x)u_y=\phi'(y-x), sum is 00) and satisfies u(s,s)=ϕ(0)=7u(s,s)=\phi(0)=7 for every choice of ϕ\phi with ϕ(0)=7\phi(0)=7. There are infinitely many such ϕ\phi (e.g. ϕ(z)=7+z\phi(z)=7+z, ϕ(z)=7+z3\phi(z) = 7+z^3, ϕ(z)=7cos⁡(z)+7(1−1)\phi(z) = 7\cos(z)+7(1-1), etc.), so uniqueness fails completely. This shows precisely what the transversality hypothesis J(s)≠0J(s)\neq 0 buys us: without it, the Cauchy problem is either unsolvable (generic incompatible data) or wildly non-unique (compatible data), and the conclusion of the theorem — existence and uniqueness — genuinely requires the hypothesis, not merely as a technical convenience.

Scope, edge cases & common traps

SituationWhat happensWhy
Γ\Gamma transversal everywhere (J(s)≠0J(s)\neq0)Unique local C1C^1 solutionMain theorem applies
Γ\Gamma tangent to a characteristic at isolated pointsSolution may exist locally away from those points but can lose regularity or uniqueness thereLocal diffeomorphism Φ\Phi fails exactly at those points
Γ\Gamma coincides with a characteristicNo solution (incompatible data) or infinitely many (compatible data)Data determined along Γ\Gamma is already fixed by the PDE itself
a,ba,b only continuous, not C1C^1 (or not Lipschitz)Characteristics may fail to be uniquePicard–Lindelöf needs local Lipschitz continuity
Coefficients a,b,c,fa,b,c,f depend on uuMethod still works but characteristics depend on the unknown solutionThis is the quasilinear case, see Quasilinear PDEs and Characteristic Curves

The mathematician behind it

Origins · 1 minJoseph-Louis Lagrange and how this was discovered
JL
Joseph-Louis Lagrange
1736–1813 · 18th-century France/Prussia, analytical mechanics and the calculus of variations

Lagrange developed the systematic reduction of first-order PDEs to systems of ODEs along special curves — what we now call the method of characteristics — as part of his broader program to recast mechanics and analysis in terms of variational and differential principles. His work on "Lagrange's method" for solving Pp+Qq=RPp+Qq=R-type equations (in the notation of his era, p=uxp=u_x, q=uyq=u_y) directly anticipated the modern treatment given here, connecting mechanics, optics, and the geometry of surfaces through the same characteristic-curve idea.

History
- 1772: Lagrange studies first-order PDEs Pp+Qq=RPp+Qq=R and reduces them to auxiliary ODE systems.
- 1784: Monge develops a geometric theory of characteristic curves for first-order PDEs, complementing Lagrange's analytic approach.
- 1841: Cauchy formalizes the initial-value (Cauchy) problem for PDEs, sharpening the notion of "sufficient data" to determine a unique solution.
- 1875: Sophus Lie situates the characteristics method within the broader theory of contact transformations and symmetry methods for differential equations.
- 1950s: the transport-equation viewpoint (first-order linear PDEs as conservation/advection laws) becomes standard in the PDE curriculum, tracing directly back to this classical method.
Why does the method work only for first-order equations, not higher order?

The chain-rule computation ddtu(x(t),y(t))=uxx′+uyy′\frac{d}{dt}u(x(t),y(t)) = u_x x' + u_y y' only involves first derivatives of uu, so it exactly matches the left side of a first-order PDE aux+buyau_x+bu_y. For a second-order PDE like uxx+uyy=0u_{xx}+u_{yy}=0, no single curve's tangent direction can absorb all the second-derivative terms into one ODE, because there are three independent second derivatives (uxx,uxy,uyyu_{xx}, u_{xy}, u_{yy}) but only one tangent direction per curve. Second-order PDEs instead have characteristic directions determined by the principal symbol (leading to hyperbolic, elliptic, parabolic classification), and only hyperbolic equations have real characteristics along which some reduction is possible, but it is more subtle than the clean ODE reduction here.

What if (a,b)=(0,0)(a,b)=(0,0) at some point of DD?

The definition explicitly requires (a,b)≠(0,0)(a,b)\neq(0,0) everywhere in DD, and this is essential: at a point where a=b=0a=b=0, the PDE degenerates to cu=fcu=f, an algebraic (not differential) constraint, and there is no characteristic direction to integrate along. Such points are called singular points of the equation. Near them the characteristic curves from the ODE system dx/dt=a, dy/dt=bdx/dt=a,\,dy/dt=b can converge to, emanate from, or spiral around the singular point, and the clean local diffeomorphism argument in the proof breaks down. Practical treatments either exclude a neighborhood of such points or study them separately using the theory of singular points of planar ODE systems.

Does the characteristic curve depend on where I start on Γ\Gamma, or is it one universal curve?

Each point of Γ\Gamma launches its own characteristic curve, so in general there is a different curve through each parameter value ss. Collectively, as ss ranges over the parameter interval, the family of characteristics sweeps out the neighborhood Ω\Omega where the solution is constructed. This is exactly the role of the map Φ(t,s)=(X(t,s),Y(t,s))\Phi(t,s)=(X(t,s),Y(t,s)) in the proof: it is a genuine two-parameter family, with tt moving along a fixed characteristic and ss selecting which characteristic (equivalently, which point of Γ\Gamma) you started from.

Can Γ\Gamma be a closed curve, like a circle, instead of an open arc?

Yes, provided the transversality condition J(s)≠0J(s)\neq 0 holds at every point of the circle and Γ\Gamma is parametrized periodically and injectively (aside from the periodic identification). The proof goes through locally near each point exactly as stated; gluing the local pieces together around the full circle requires slightly more care (a partition-of-unity or covering argument) but presents no new conceptual obstruction as long as transversality is uniform. The resulting solution lives in an annular neighborhood of the circle.

How is this different from just guessing u=ϕ(y−x)u=\phi(y-x) for the simplest case ux+uy=0u_x+u_y=0?

Guessing u=ϕ(y−x)u = \phi(y-x) works precisely because it encodes "constant along characteristics y−x=consty-x=\text{const}," which is exactly what the method of characteristics proves rigorously and systematically. The method's value is that it works even when the characteristics are not straight lines and the coefficient cc is nonzero (so uu is not simply constant along characteristics but instead solves a nontrivial ODE), situations where guessing the right functional form is not obvious. The method also comes with a precise existence–uniqueness guarantee (the transversality condition), which pure guessing does not provide.

What is the geometric meaning of the Jacobian J(s)J(s) vanishing?

J(s)=ay0′−bx0′J(s) = a y_0' - b x_0' is (up to sign) the cross product of the characteristic direction vector (a,b)(a,b) and the tangent vector (x0′,y0′)(x_0',y_0') to Γ\Gamma at that point. It vanishes exactly when these two vectors are parallel, i.e. when Γ\Gamma is tangent to the characteristic direction at that point. Geometrically, transversality means Γ\Gamma crosses every characteristic at a genuine angle, never grazing one tangentially, which is what allows the "sweep" of characteristics from Γ\Gamma to fill out a two-dimensional neighborhood rather than collapsing onto a lower-dimensional set.

Does this method require the equation to be linear, or does quasilinear also work the same way?

The construction generalizes to the quasilinear equation a(x,y,u)ux+b(x,y,u)uy=f(x,y,u)a(x,y,u)u_x + b(x,y,u)u_y = f(x,y,u), but with an important twist: the characteristic ODE system dx/dt=a, dy/dt=bdx/dt=a,\,dy/dt=b now depends on uu itself, so the characteristic curves are not known in advance — they must be solved for simultaneously with uu along them, as a coupled system (x′(t),y′(t),u′(t))=(a,b,f)(x'(t),y'(t),u'(t)) = (a,b,f) evaluated at (x,y,u)(x,y,u). This coupled ODE system is the subject of Quasilinear PDEs and Characteristic Curves, and it is where phenomena like characteristics crossing (shock formation) first appear, something impossible in the linear case since linear characteristics never depend on uu and hence never cross due to uu-dependence.

Where this leads