Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§5, proof of Theorem 5.2, p. 6 — every φ ∈ b[M×N, Z], Z Banach, extends to φ̃ ∈ b[M⁻×N⁻, Z] with ‖φ̃‖ = ‖φ‖

Proved
BilinearMapExtension.Complemented.extension_to_closures

by mikedeng1 · Oct 22, 2026 · Mathlib 0df444a (Lean v4.33.1)

banach-spacebilinear-mapclosureextensionp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let M\mathcal MM and N\mathcal NN be linear manifolds of normed spaces X\mathcal XX and Y\mathcal YY over F∈{R,C}\mathbb F\in\{\mathbb R,\mathbb C\}F∈{R,C}, with closures M−\mathcal M^-M− and N−\mathcal N^-N−, and let Z\mathcal ZZ be a Banach space. Every bounded bilinear map ϕ∈b[M×N,Z]\phi\in\boldsymbol b[\mathcal M\times\mathcal N,\mathcal Z]ϕ∈b[M×N,Z] has a bounded bilinear extension ϕ~∈b[M−×N−,Z]\widetilde\phi\in\boldsymbol b[\mathcal M^-\times\mathcal N^-,\mathcal Z]ϕ​∈b[M−×N−,Z] of the same norm:

ϕ~∣M×N=ϕ,∥ϕ~∥=∥ϕ∥.\widetilde\phi|_{\mathcal M\times\mathcal N} = \phi, \qquad \|\widetilde\phi\| = \|\phi\|.ϕ​∣M×N​=ϕ,∥ϕ​∥=∥ϕ∥.

This is the first half of the sufficiency direction of Theorem 5.2(a), and the source of the equality ∥ϕ^∥=∥ϕ∥\|\widehat\phi\| = \|\phi\|∥ϕ​∥=∥ϕ∥ in Theorem 5.2(b).

Formalization Note. Bilinear maps on M−×N−\mathcal M^-\times\mathcal N^-M−×N− are continuous linear maps M.topologicalClosure →L[𝕜] N.topologicalClosure →L[𝕜] Z; "ϕ~\widetilde\phiϕ​ restricts to ϕ\phiϕ" is stated through the inclusions M↪M−\mathcal M\hookrightarrow\mathcal M^-M↪M−, N↪N−\mathcal N\hookrightarrow\mathcal N^-N↪N−. The norms are Mathlib operator norms, equal to the paper's bilinear norms by Proposition 4.2. A printed slip in the paper's norm computation (the first supremum reads ϕ(u~,v~)\phi(\widetilde u,\widetilde v)ϕ(u,v) for ϕ~(u~,v~)\widetilde\phi(\widetilde u,\widetilde v)ϕ​(u,v)) does not affect the statement.

Preamble
import Mathlib
import Definitions.Def_BilinearMapExtension_Complemented_Setting
Formal statement
namespace BilinearMapExtension.Complemented

/-- §5, proof of Theorem 5.2, (a2)⇒(a1) and (b), p. 6: `φ` extends to `φ̃ ∈ b[M⁻×N⁻, Z]` with
`‖φ̃‖ = ‖φ‖`. -/
theorem extension_to_closures {𝕜 : Type*} [RCLike 𝕜] {X Y Z : Type*}
    [NormedAddCommGroup X] [NormedSpace 𝕜 X] [NormedAddCommGroup Y] [NormedSpace 𝕜 Y]
    [NormedAddCommGroup Z] [NormedSpace 𝕜 Z] [CompleteSpace Z]
    (M : Submodule 𝕜 X) (N : Submodule 𝕜 Y) (φ : M →L[𝕜] N →L[𝕜] Z) :
    ∃ φt : M.topologicalClosure →L[𝕜] N.topologicalClosure →L[𝕜] Z,
      (∀ (u : M) (v : N), φt (Submodule.inclusion M.le_topologicalClosure u)
        (Submodule.inclusion N.le_topologicalClosure v) = φ u v) ∧ ‖φt‖ = ‖φ‖ := by sorry

end BilinearMapExtension.Complemented
Source
Kubrusly, On extensions of bilinear maps, arXiv:2110.03102v2, p. 6, §5, proof of Theorem 5.2, (a2)⇒(a1) and (b)
Human review
  • Endorsed by Shuze Chen · Oct 23, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 23, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me