Nonmaximal sums of maximally monotone operators under Rockafellar's constraint qualification
Rockafellar's sum theorem guarantees maximal monotonicity of a sum of maximally monotone operators in reflexive Banach spaces under an interior-domain condition. Whether this condition alone suffices on arbitrary Banach spaces (the unrestricted sum question) was open.
A general construction theorem is established that computes the entire monotone polar of a class of graphs, giving a necessary and sufficient condition for their maximal monotonicity. Adding an everywhere-defined positive rank-one operator is shown to yield a nonmaximal sum under the interior-domain condition. The hypotheses and maximality criterion are verified on c0, and a bounded linear surjection from ℓ1 onto c0 transfers the result. Lean formalizations of the c0 counterexample and the pullback lemma are provided.
Explicit counterexamples to Rockafellar's sum conjecture are constructed on c0 and on standard ℓ1: two maximally monotone operators satisfy the interior-domain condition yet their sum is not maximally monotone. A finite radial bound is proved for one operator in each pair.
