Jump to content

Hamilton's principle/Mathematics/The Weierstrass excess function: Difference between revisions

From The Invariance Itself
hamiltons-principle>HPVBuild
Initial import of M2-07
 
Pipe internal links so cross-references read as titles, not paths
 
(2 intermediate revisions by the same user not shown)
Line 1: Line 1:
{{DISPLAYTITLE:The Weierstrass excess function}}
{{Plebeian|Hamilton's principle/Explainers/Strong and weak}}
{{Plebeian|Hamilton's principle/Explainers/Strong and weak}}


Line 11: Line 12:
[[File:OPL-HP-F-13.png|thumb|right|400px|A sawtooth competitor close in position and far in slope.]]
[[File:OPL-HP-F-13.png|thumb|right|400px|A sawtooth competitor close in position and far in slope.]]


From [[Hamilton's principle/Mathematics/Functionals and the space of paths]], the
From [[Hamilton's principle/Mathematics/Functionals and the space of paths|Functionals and the space of paths]], the
weak norm controls position and slope, the strong norm controls position only. A
weak norm controls position and slope, the strong norm controls position only. A
strong neighbourhood is the larger set, so a strong minimum is the stronger
strong neighbourhood is the larger set, so a strong minimum is the stronger
Line 70: Line 71:
'''Sufficiency.''' If <math>y</math> satisfies the Euler-Lagrange equation, can
'''Sufficiency.''' If <math>y</math> satisfies the Euler-Lagrange equation, can
be embedded in a field of extremals — which the Jacobi condition of
be embedded in a field of extremals — which the Jacobi condition of
[[Hamilton's principle/Mathematics/The Jacobi condition and conjugate points]]
[[Hamilton's principle/Mathematics/The Jacobi condition and conjugate points|the Jacobi condition and conjugate points]]
guarantees — and <math>E > 0</math> for all <math>q \neq p</math> at every point
guarantees — and <math>E > 0</math> for all <math>q \neq p</math> at every point
of a neighbourhood of the extremal, then <math>y</math> is a strong local minimum.
of a neighbourhood of the extremal, then <math>y</math> is a strong local minimum.
Line 146: Line 147:
in the second-variation theory could have detected this: the sawtooth is not a
in the second-variation theory could have detected this: the sawtooth is not a
small variation in the weak norm, and the whole of
small variation in the weak norm, and the whole of
[[Hamilton's principle/Mathematics/The second variation]] is about small weak
[[Hamilton's principle/Mathematics/The second variation|the second variation]] is about small weak
variations.
variations.


Line 153: Line 154:
The strong class admits paths with corners, so the Weierstrass-Erdmann conditions
The strong class admits paths with corners, so the Weierstrass-Erdmann conditions
of
of
[[Hamilton's principle/Mathematics/Boundary terms and natural boundary conditions]]
[[Hamilton's principle/Mathematics/Boundary terms and natural boundary conditions|Boundary terms and natural boundary conditions]]
apply. The relation to (1) is direct: <math>E \equiv 0</math> along a segment
apply. The relation to (1) is direct: <math>E \equiv 0</math> along a segment
means <math>L</math> is affine in the slope there, which is the degeneracy that
means <math>L</math> is affine in the slope there, which is the degeneracy that
Line 164: Line 165:
strengthened hypotheses, what guarantees one. It has also produced two explicit
strengthened hypotheses, what guarantees one. It has also produced two explicit
failures — the conjugate-point failure on
failures — the conjugate-point failure on
[[Hamilton's principle/Mathematics/The Jacobi condition and conjugate points]]
[[Hamilton's principle/Mathematics/The Jacobi condition and conjugate points|the Jacobi condition and conjugate points]]
and the strong-class failure above — in each case with an exhibited competitor
and the strong-class failure above — in each case with an exhibited competitor
rather than an assertion.
rather than an assertion.
Line 174: Line 175:
minimum''. Whether a minimiser exists at all is the direct method, which this
minimum''. Whether a minimiser exists at all is the direct method, which this
volume does not treat and which is named as further reading on
volume does not treat and which is named as further reading on
[[Hamilton's principle/Sources]].
[[Hamilton's principle/Sources|Sources]].


== Next ==
== Next ==


[[Hamilton's principle/Mathematics/The Legendre transform]] opens the third
[[Hamilton's principle/Mathematics/The Legendre transform|the Legendre transform]] opens the third
mathematics track, on structure.
mathematics track, on structure.


Line 184: Line 185:


<references />
<references />

Latest revision as of 04:57, 16 September 2026

Plain-language version: Strong and weak

Every sufficiency result so far has been for weak minima — minima against competitors that stay close in both position and slope. Widening the comparison class to paths that stay close in position only, with slope unrestricted, requires one further condition. It is Weierstrass's, and it completes the classical theory.

The two comparison classes

A sawtooth competitor close in position and far in slope.

From Functionals and the space of paths, the weak norm controls position and slope, the strong norm controls position only. A strong neighbourhood is the larger set, so a strong minimum is the stronger claim, and every strong minimum is a weak minimum.

The gap is real. A competitor may run alongside the extremal in position while oscillating steeply in slope — a sawtooth of small amplitude and large gradient. Such a path is far from the extremal in the weak norm and close in the strong one, so no weak result says anything about it.

The Legendre and Jacobi conditions of the previous two pages are both derived from the second variation, which is a small-ε object. They cannot see a competitor whose slope differs by O(1).

The excess function

The Weierstrass excess function as a gap above the tangent.

Definition. The Weierstrass excess function is

E(x,y,p,q)=L(x,y,q)−L(x,y,p)−(q−p)Ly′(x,y,p)(1)

Read (1) as a remainder. L(x,y,p)+(q−p)Ly′(x,y,p) is the tangent line to L in its third slot at p, evaluated at q. So E is the amount by which L exceeds its own tangent line.

E≥0 for all q is therefore exactly the statement that L is convex in its slope argument — not merely at p, which is Legendre's local condition, but across the whole range of slopes a competitor might use.

The relation between the two is worth setting down. Taylor expansion of (1) in q about p gives

E=12(q−p)2Ly′y′(x,y,p¯)(2)

for some p¯ between p and q. So E≥0 near q=p is Legendre's condition, and E≥0 for all q is a genuinely stronger demand: Ly′y′≥0 must hold not only along the extremal but at every slope, at each point of a neighbourhood.

The conditions assembled

A corner in an extremal.

Weierstrass's necessary condition. If y is a strong local minimum then

E(x,y(x),y′(x),q)≥0(3)

for every x∈[a,b] and every real q.

Sufficiency. If y satisfies the Euler-Lagrange equation, can be embedded in a field of extremals — which the Jacobi condition of the Jacobi condition and conjugate points guarantees — and E>0 for all q≠p at every point of a neighbourhood of the extremal, then y is a strong local minimum.

The necessary form is proved by a needle variation of a different kind from Legendre's: the competitor departs from the extremal at one point with a slope q quite unlike y′, runs briefly, and rejoins. Such a path is strongly close and weakly far. Computing J along it to first order in the departure length gives exactly E as the leading change, so E<0 anywhere produces a cheaper competitor.

The full hierarchy

The four conditions of the sufficiency theory.
condition scope necessary for sufficient with the others for
Euler-Lagrange pointwise, 1st order both —
Legendre P≥0 pointwise, 2nd order both —
Jacobi, no conjugate point interval, 2nd order both weak minimum
Weierstrass E≥0 pointwise, all slopes strong only strong minimum

Four conditions, and only the strengthened combinations in the last column are sufficient for anything. That is the honest summary of the classical theory, and it is the reason this volume has taken seven pages to reach a sufficiency statement.

Worked example: where the strong claim fails

Take

J[y]=∫01(y'2−y'4)dx(4)

with y(0)=y(1)=0. The extremal y≡0 satisfies the Euler-Lagrange equation, and

Ly′y′=2−12y'2(5)

which at y′=0 equals 2>0. Legendre's strengthened condition holds. Q=0, so the accessory equation is η″=0, whose solution vanishing at the origin is η=cx, with no second zero. No conjugate point. Jacobi's condition holds. The extremal is therefore a weak minimum, and J[0]=0.

Now compute the excess function at p=0:

E(x,y,0,q)=(q2−q4)−0−q⋅0=q2(1−q2)(6)

which is negative for |q|>1. Weierstrass's condition fails.

The failure is realised by an explicit competitor. Let yn be a sawtooth of slope ±2 with n teeth on [0,1]. Its amplitude is 1/n, so ‖yn‖0→0 and it is strongly close to the extremal. But yn'2=4 and yn'4=16 everywhere, so

J[yn]=∫01(4−16)dx=−12(7)

independent of n. Every one of these paths beats J[0]=0, and they crowd arbitrarily close to the extremal in position.

So y≡0 is a weak minimum and is not a strong minimum. Nothing in the second-variation theory could have detected this: the sawtooth is not a small variation in the weak norm, and the whole of the second variation is about small weak variations.

Corners

The strong class admits paths with corners, so the Weierstrass-Erdmann conditions of Boundary terms and natural boundary conditions apply. The relation to (1) is direct: E≡0 along a segment means L is affine in the slope there, which is the degeneracy that permits a corner. Strict convexity, E>0, forbids corners and recovers the smooth theory.

What this track has and has not settled

O6 closes here. The track has established what a minimum requires and, under strengthened hypotheses, what guarantees one. It has also produced two explicit failures — the conjugate-point failure on the Jacobi condition and conjugate points and the strong-class failure above — in each case with an exhibited competitor rather than an assertion.

Two limits are worth stating plainly. All of this is local: it compares an extremal with nearby paths and says nothing about a distant competitor. And existence has been assumed throughout: every theorem here has the form if an extremal is a minimum then, or if these conditions hold then it is a local minimum. Whether a minimiser exists at all is the direct method, which this volume does not treat and which is named as further reading on Sources.

Next

the Legendre transform opens the third mathematics track, on structure.

References