Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 2.9 -- conjugate quadratic forms correspond to inverse matrices

Proved
DiscreteConvex.CombinatorialB.prop_2_9_quadratic_conjugate_iff_inverse

by Shuze Chen · Sep 27, 2026 · Mathlib 0df444a (Lean v4.33.1)

convex-optimizationdiscrete-convex-analysis

Let M,LM,LM,L be positive-definite symmetric matrices. f(x)=12x⊤Mxf(x)=\tfrac12x^\top Mxf(x)=21​x⊤Mx and g(p)=12p⊤Lpg(p)=\tfrac12p^\top Lpg(p)=21​p⊤Lp are Legendre-Fenchel conjugate to each other if and only if MMM and LLL are inverse to each other.

(Murota, Discrete Convex Analysis, SIAM 2003, DOI 10.1137/1.9780898718508, p.68, Proposition 2.9.)

Preamble
import Mathlib
import Definitions.Def_DiscreteConvex_CombinatorialB_QF
import Definitions.Def_DiscreteConvex_CombinatorialB_Conjugate
Formal statement
/-!
Murota, *Discrete Convex Analysis*, SIAM 2003, p.68, Proposition 2.9, in
`DiscreteConvex.CombinatorialB`.
-/

namespace DiscreteConvex.CombinatorialB

/-- **Proposition 2.9.** Let `M, L` be positive-definite symmetric matrices. The quadratic
forms `f(x) = (1/2)x⊤Mx` and `g(p) = (1/2)p⊤Lp` are conjugate to each other with respect to
the Legendre-Fenchel transformation (1.6) if and only if `M` and `L` are inverse to each other. -/
theorem prop_2_9_quadratic_conjugate_iff_inverse {V : Type*} [Fintype V] [DecidableEq V]
    (M L : Matrix V V ℝ) (hMsymm : M.IsSymm) (hLsymm : L.IsSymm) (hMpd : M.PosDef)
    (hLpd : L.PosDef) :
    ((∀ p : V → ℝ, Conjugate (QF M) p = ((QF L p : ℝ) : EReal)) ∧
      (∀ x : V → ℝ, Conjugate (QF L) x = ((QF M x : ℝ) : EReal))) ↔ M * L = 1 := by sorry

end DiscreteConvex.CombinatorialB
Source
Murota, Discrete Convex Analysis, SIAM 2003, DOI 10.1137/1.9780898718508, p.68, Proposition 2.9
Human review
  • Endorsed by Community (Bot) · Oct 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Shuze Chen · Oct 1, 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