Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

The feasible set of nonnegative weights with fixed linear moments

Definition
HlawkaSchatten_DiagonalConstruction_Sparsification

by savarin · Sep 28, 2026 · Mathlib 0df444a (Lean v4.33.1)

concave-minimizationdiagonal-constructionhlawka-schattenmoment-constraintssparsification

momentFiber is the set of nonnegative weight vectors, indexed by an arbitrary finite type ι\iotaι, satisfying three prescribed linear moment constraints: given a moment assignment A:ι→({0,1,2}→R)A:\iota\to(\{0,1,2\}\to\mathbb{R})A:ι→({0,1,2}→R) and a target b:{0,1,2}→Rb:\{0,1,2\}\to\mathbb{R}b:{0,1,2}→R,

momentFiber⁡(A,b)={ w:ι→R ∣ (∀i, wi≥0) and (∀k∈{0,1,2}, ∑iwi A(i,k)=b(k)) }.\operatorname{momentFiber}(A,b) = \Big\{\, w:\iota\to\mathbb{R} \ \Big|\ (\forall i,\ w_i\ge 0)\ \text{and}\ \big(\forall k\in\{0,1,2\},\ \textstyle\sum_i w_i\,A(i,k) = b(k)\big) \,\Big\}.momentFiber(A,b)={w:ι→R ​ (∀i, wi​≥0) and (∀k∈{0,1,2}, ∑i​wi​A(i,k)=b(k))}.

This is the feasible set for the three-coordinate reduction step of the sharp diagonal construction. A theorem in the same source module shows that, when AAA has nonnegative entries with every row sum ∑kA(i,k)\sum_k A(i,k)∑k​A(i,k) positive (so the fiber is compact) and FFF is continuous and concave on the nonnegative orthant {w∣∀i, wi≥0}\{w\mid\forall i,\ w_i\ge0\}{w∣∀i, wi​≥0}, every w0∈momentFiber⁡(A,b)w_0\in\operatorname{momentFiber}(A,b)w0​∈momentFiber(A,b) is matched by some w∈momentFiber⁡(A,b)w\in\operatorname{momentFiber}(A,b)w∈momentFiber(A,b) with F(w)≤F(w0)F(w)\le F(w_0)F(w)≤F(w0​) and at most three nonzero coordinates. In the intended use, A(i,⋅)A(i,\cdot)A(i,⋅) records the moments contributed by coordinate iii toward three fixed pair power sums of a coordinate triple, and bbb holds their target values while the weights are varied; the definition itself is stated for an arbitrary moment matrix AAA and target bbb, with no reference to power sums.

Definition code
import Mathlib.Analysis.Convex.Function
import Mathlib.Analysis.Normed.Module.FiniteDimension
import Mathlib.LinearAlgebra.Dimension.Finite
import Mathlib.Tactic.Linarith
import Mathlib.Tactic.Positivity
import Mathlib.Tactic.Ring
import Mathlib.Topology.Order.Compact

/-
Copyright (c) 2026 Ezzeri Esa. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Ezzeri Esa
-/

/-!
# Three constraints admit a sparse concave minimizer

For nonnegative coordinate weights, fixing three positive linear moments
gives a compact feasible set. Minimize the concave objective, then maximize
the sum of squared weights among its minimizers. A supported kernel
direction would produce two feasible perturbations whose average squared
size is strictly larger. Thus at most three weights are positive.
-/

namespace HlawkaSchatten.DiagonalConstruction

variable {ι : Type*} [Fintype ι]

def momentFiber (A : ι → Fin 3 → ℝ) (b : Fin 3 → ℝ) : Set (ι → ℝ) :=
  {w | (∀ i, 0 ≤ w i) ∧ ∀ k, ∑ i, w i * A i k = b k}







end HlawkaSchatten.DiagonalConstruction
Source
https://github.com/savarin/hlawka-schatten/blob/79aa498bfcf7b22bd91d771fb32ec278e2d4704b/HlawkaSchatten/DiagonalConstruction/Sparsification.lean#L28-L29
Human review
  • Endorsed by Shuze Chen · Sep 29, 2026

    Confirmed by the moderator at approval.

  • Endorsed by savarin · Sep 29, 2026

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

  • Endorsed by marwahaha · Sep 30, 2026

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me