Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.1 — a PSD matrix below a boundary point of Sd+S_d^+Sd+​ lies on the boundary

Proved
AffinePSD.Necessity.lemma_3_1

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

matrix-analysisp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1positive-semidefinite-matrices

Let u∈∂Sd+=Sd+∖Sd++u \in \partial S_d^+ = S_d^+ \setminus S_d^{++}u∈∂Sd+​=Sd+​∖Sd++​ and let v∈Sd+v \in S_d^+v∈Sd+​ with v⪯uv \preceq uv⪯u, i.e. u−v∈Sd+u - v \in S_d^+u−v∈Sd+​. Then

v∈∂Sd+.v \in \partial S_d^+.v∈∂Sd+​.

This elementary observation about the order on the cone is what turns order preservation of ψ\psiψ into a statement about the boundary in the proof that ψ(t,⋅)\psi(t,\cdot)ψ(t,⋅) maps Sd++S_d^{++}Sd++​ into itself (Lemma 3.3).

Preamble
import Mathlib
import Definitions.Def_AffinePSD_Necessity_Cone
Formal statement
namespace AffinePSD.Necessity

/-- Lemma 3.1 (Cuchiero, Filipović, Mayerhofer, Teichmann, arXiv:0910.0137v3, §3, p. 15):
if `u ∈ ∂S_d^+` and `S_d^+ ∋ v ⪯ u`, then `v ∈ ∂S_d^+`.

**Formalization Note.** `∂S_d^+ = S_d^+ ∖ S_d^{++}` is `PSD ∧ ¬ PD`; `v ⪯ u` is `PSD (u − v)`. -/
theorem lemma_3_1 {d : ℕ} (u v : Mat d) (hu : PSD u) (hu' : ¬ PD u) (hv : PSD v)
    (hvu : PSD (u - v)) : PSD v ∧ ¬ PD v := by sorry

end AffinePSD.Necessity
Source
Cuchiero, Filipović, Mayerhofer, Teichmann, Affine processes on positive semidefinite matrices, arXiv:0910.0137v3 (2011), Lemma 3.1, p. 15
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 7, 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