Maximal monotonicity of closed-ball normal cones #
This module proves maximal monotonicity of a positive-radius closed-ball normal cone under surjectivity of the dual-pairing map.
theorem
DualPairing.maximalMonotone_normalConeGraph_closedBall
{X : Type u}
{Xstar : Type v}
[NormedAddCommGroup X]
[NormedSpace ℝ X]
[NormedAddCommGroup Xstar]
[NormedSpace ℝ Xstar]
(P : DualPairing X Xstar)
(h_surjective : Function.Surjective ⇑P.toDual)
(r : ℝ)
(hr : 0 < r)
:
Maximal P.IsMonotone (P.normalConeGraph (Metric.closedBall 0 r))
The normal-cone graph of a positive-radius closed ball is maximally monotone when the pairing map onto the strong dual is surjective.