Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Definition 1, p. 354 — for J = 2 the symmetric multiple logistic transformation is the two-class ½ log[p/(1−p)] and (40) is (13)

Proved
AddLogReg.Multiclass.def_1_two_class

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

logistic-regressionmulticlass-classificationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1softmax

Take J=2J = 2J=2 classes. Let p=(p1,p2)p=(p_1,p_2)p=(p1​,p2​) with p1,p2>0p_1,p_2>0p1​,p2​>0 and p1+p2=1p_1+p_2 = 1p1​+p2​=1, and let F=(F1,F2)F = (F_1,F_2)F=(F1​,F2​) be a real vector with F1+F2=0F_1+F_2 = 0F1​+F2​=0. Then:

  1. the transformation (39) is the two-class symmetric log-odds of (12), and is antisymmetric:
F1(p)=12log⁡p1p2,F2(p)=−F1(p),F_1(p) = \frac12\log\frac{p_1}{p_2},\qquad F_2(p) = -F_1(p),F1​(p)=21​logp2​p1​​,F2​(p)=−F1​(p),

where Fj(p)=log⁡pj−12(log⁡p1+log⁡p2)F_j(p) = \log p_j - \frac12(\log p_1+\log p_2)Fj​(p)=logpj​−21​(logp1​+logp2​); 2. the probabilities (40) are the two-class symmetric logistic (13):

eF1eF1+eF2=eF1eF1+e−F1,eF2eF1+eF2=1−eF1eF1+eF2.\frac{e^{F_1}}{e^{F_1}+e^{F_2}} = \frac{e^{F_1}}{e^{F_1}+e^{-F_1}},\qquad \frac{e^{F_2}}{e^{F_1}+e^{F_2}} = 1-\frac{e^{F_1}}{e^{F_1}+e^{F_2}} .eF1​+eF2​eF1​​=eF1​+e−F1​eF1​​,eF1​+eF2​eF2​​=1−eF1​+eF2​eF1​​.

This is "the equivalence with the two-class case" asserted after Definition 1: with class 1 as y=1y=1y=1, the multiclass parametrization reduces to F(x)=12log⁡[P(y=1∣x)/P(y=−1∣x)]F(x) = \frac12\log[P(y=1\mid x)/P(y=-1\mid x)]F(x)=21​log[P(y=1∣x)/P(y=−1∣x)] and p(x)=eF(x)/(eF(x)+e−F(x))p(x) = e^{F(x)}/(e^{F(x)}+e^{-F(x)})p(x)=eF(x)/(eF(x)+e−F(x)) of §4.

Formalization Note Classes are Fin 2 with 000 playing class 1 and 111 playing class 2.

Preamble
import Mathlib
import Definitions.Def_AddLogReg_Multiclass_Setting

open MeasureTheory ProbabilityTheory ENNReal
Formal statement
namespace AddLogReg.Multiclass

theorem def_1_two_class (p : Fin 2 → ℝ) (hp_pos : ∀ j, 0 < p j) (hp_sum : ∑ j, p j = 1)
    (F : Fin 2 → ℝ) (hF : F 0 + F 1 = 0) :
    symMultiLogit p 0 = (1 / 2) * Real.log (p 0 / p 1) ∧
      symMultiLogit p 1 = -symMultiLogit p 0 ∧
      softmax F 0 = Real.exp (F 0) / (Real.exp (F 0) + Real.exp (-F 0)) ∧
      softmax F 1 = 1 - softmax F 0 := by sorry

end AddLogReg.Multiclass
Source
Friedman, Hastie and Tibshirani, Additive logistic regression: a statistical view of boosting, Ann. Statist. 28 (2000), p. 354, Definition 1, last sentence ("as well as the equivalence with the two-class case"); p. 345, (12)–(13)
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