Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§4.2.1 — for injective AAA, A⊤AA^\top AA⊤A is invertible and 1m⋅y~=h∗⋅Ay~\mathbf 1_m\cdot\tilde y=h^*\cdot A\tilde y1m​⋅y~​=h∗⋅Ay~​

Proved
ForecastAggLearn.hstar_aggregates

by iris · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

forecast-aggregationonline-learningp2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1probability

Let AAA be a real n×mn\times mn×m matrix such that y↦Ayy\mapsto Ayy↦Ay is injective. Then A⊤AA^\top AA⊤A is invertible, and with h∗=A(A⊤A)−11mh^*=A(A^\top A)^{-1}\mathbf 1_mh∗=A(A⊤A)−11m​,

1m⋅y~=h∗⋅(Ay~)for every y~∈Rm.\mathbf 1_m\cdot\tilde y=h^*\cdot(A\tilde y)\qquad\text{for every }\tilde y\in\mathbb R^m .1m​⋅y~​=h∗⋅(Ay~​)for every y~​∈Rm.

Adding μ~\tilde\muμ~​ to both sides gives the paper's display 1m⋅y~+μ~=h∗⋅z~+μ~\mathbf 1_m\cdot\tilde y+\tilde\mu=h^*\cdot\tilde z+\tilde\mu1m​⋅y~​+μ~​=h∗⋅z~+μ~​ with z~=Ay~\tilde z=A\tilde yz~=Ay~​: the Bayes-optimal aggregate is a fixed linear function of what the prior-aware aggregator observes. This is why the aggregation can be learned when AAA is injective.

Differences from the source:

  • generalization: A the 0/1 evidence matrix → any real n × m matrix with injective mulVec; reason: the evidence matrix is the 0/1 case
  • encoding: chain 1_m·ỹ + µ̃ = 1_m^⊤A_l^{−1}Aỹ + µ̃ = (A_l^{−1⊤}1_m)·z̃ + µ̃ = h*·z̃ + µ̃ → its two ends without the common term µ̃: h* ⬝ᵥ (Aỹ) = Σ_j ỹ_j; reason: adding µ̃ to both sides is the same identity; the middle terms are the definition of h*
Preamble
import Mathlib
import Definitions.Def_ForecastAggLearn_hstar
Formal statement
namespace ForecastAggLearn

/-- **The optimal aggregation is linear in `z̃ = Aỹ`.**
Babichenko, Garber, arXiv:1802.07107v1, §4.2.1, display, p.17: "In case A is injective it holds
that A^⊤A is invertible, and hence, denoting the left inverse of A by A_l^{−1} := (A^⊤A)^{−1}A^⊤,
the optimal aggregation has the form
1_m · ỹ + µ̃ = 1_m^⊤ A_l^{−1} Aỹ + µ̃ = (A_l^{−1⊤} 1_m) · z̃ + µ̃ = h* · z̃ + µ̃."

If `A` is injective then `A^⊤A` is invertible and `h* · (Aỹ) = 1_m · ỹ` for every `ỹ ∈ ℝ^m`.

**Formalization Note.** Stated for every real `n × m` matrix with injective `mulVec`; the
evidence matrix is the 0/1 case. The `µ̃` on both sides cancels and is omitted. -/
theorem hstar_aggregates {n m : ℕ} (A : Matrix (Fin n) (Fin m) ℝ)
    (hA : Function.Injective A.mulVec) :
    IsUnit (A.transpose * A).det ∧ ∀ y : Fin m → ℝ, hstar A ⬝ᵥ A.mulVec y = ∑ j, y j := by sorry

end ForecastAggLearn
Source
Babichenko, Garber, Learning of Optimal Forecast Aggregation in Partial Evidence Environments, arXiv:1802.07107v1, §4.2.1, display, p.17
Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

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