Argument principle Created 2026-09-24 Updated 2026-10-14
The argument principle turns a boundary journey into an interior count: follow the values of a meromorphic function around a contour, and count their net turns around zero. Every enclosed zero of a function contributes its multiplicity of a zero; every enclosed pole subtracts its order. There is no need to find each zero of a function separately.
Let be a piecewise smooth simple closed curve with positive orientation of a contour. Suppose is a meromorphic function on an open neighborhood of the curve and its interior, with no zeros of a function or poles on . ThenHere is the sum of the zero multiplicities inside , and is the sum of the orders of its enclosed poles. The image contour may cross itself or revisit a point. Its signed winding number, rather than the number of visually bounded regions, is the quantity that counts.[ref]
For the polynomial and the unit circle , , the image is . It goes around zero three times although its drawn outline is just one circle. The interior contains one distinct zero of a function, at zero, with multiplicity of a zero three: the count is three. Reversing the orientation of a contour reverses the winding number and the sign of the contour integral.
An argument must be followed continuously along the journey. Subtracting the principal arguments at the endpoints loses whole turns: a closed image contour has the same endpoint value even when its winding number is nonzero. Nor does winding number zero prove that there are no zeros of a function: one enclosed simple zero of a function and one enclosed simple pole cancel in . Known poles must be added back to recover .
The mechanism is short. Near a zero of a function of order , factor with a nonvanishing holomorphic function. Its logarithmic derivative is , so its residue is . A pole of order gives residue . The residue theorem adds those contributions. Changing variables to identifies the resulting contour integral with the winding number. This is a local algebraic count joined to a global geometric count.[ref]
The usefulness goes beyond explicit polynomials. Rouché's theorem keeps a count unchanged when a boundary perturbation cannot push the image contour through zero. The Nyquist stability criterion applies the same counting idea to poles governing a system under feedback control.[ref]
In a thin constant-density disk with free surfaces , neglect slow radial gradients and let perturbations vary as . With , the local inviscid equations are , , and . Eliminating velocity gives . This local WKB approximation assumes and and has both surface and inertial wave branches.
// Target: astrophysics.bigb
Dynamical systems Created 2026-09-24 Updated 2026-10-13
The study of dynamical systems asks how a state changes in time: which states persist, which orbits repeat, and how a small perturbation changes the future. A dynamical system combines a state space with an evolution rule. For a seasonal population, the state might be its abundance and one step one generation; for a harmonic oscillator, a state vector includes both position and velocity. Choosing a sufficient state is essential: position alone does not determine where an oscillator moves next.
The two basic descriptions are a discrete dynamical system, , and an ordinary differential equation, . Repeated iteration of a map gives ; an autonomous differential equation with unique solutions gives a flow map . In either case, evolving for two successive durations agrees with evolving for their sum. The logistic map provides a particularly simple discrete dynamical system; the Lorenz system supplies a continuous-time example with a very different geometry.
Deterministic evolution says that the exact rule and exact initial condition specify one future. Predicting that future from measurements is a separate question. An instrument supplies a range of possible initial conditions, and a computation adds small errors. Near an asymptotically stable fixed point, nearby orbits converge and the long-term state can become easier to predict. With sensitive dependence on initial conditions, arbitrarily close starting states can eventually lead to a visible disagreement, even though each follows the same rule.
Much of the usefulness of dynamical systems comes from describing outcomes without writing every solution explicitly. Fixed points identify possible resting states; periodic orbits identify repeating behaviour; stability theory asks whether those behaviours survive small disturbances. A bifurcation diagram shows how changing a bifurcation parameter changes the possible outcomes. This is useful in population dynamics, where a stable abundance and an alternating abundance have different consequences, and in thermal convection, where a steady flow and a changing flow transport heat differently.
The beauty of the subject is that a small formula can organize a large variety of behaviour. The logistic map moves from an attracting fixed point to attracting periodic orbits and then to parameter values supporting sensitive motion. Its period-doubling cascade has a recognizable structure across many unimodal maps. Nevertheless, Devaney chaos, Glendinning chaos, and a positive Lyapunov exponent express different properties; a claim of chaos should specify its definition, its state space, and the parameter values under consideration.
Lagrangian fluid displacement 2026-10-14
The Lagrangian fluid displacement compares neighbouring fluid trajectories. Linear velocity perturbations about a steady flow obey . For a background scalar , its material perturbation is . In an axisymmetric normal mode about cylindrical rotation, the radial and vertical velocities are and . The displacement of a free surface is needed to impose the Lagrangian pressure perturbation condition.
// Target: astrophysics.bigb