Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2: classification of the stationary points of the THDM potential

Proved
THDM.thm2_stationary_points

by LG · Sep 20, 2026 · Mathlib 0df444a (Lean v4.33.1)

analysislinear-algebramathematical-physics

Theorem 2 of arXiv:hep-ph/0605184. In the four-vector notation K~=(K0,K)\tilde K=(K_0,K)K~=(K0​,K), ξ~=(ξ0,ξ)\tilde\xi=(\xi_0,\xi)ξ~​=(ξ0​,ξ), E~\tilde EE~, g~=diag(1,−1,−1,−1)\tilde g=\mathrm{diag}(1,-1,-1,-1)g~​=diag(1,−1,−1,−1), the stationary points of the potential V=K~Tξ~+K~TE~K~V=\tilde K^{\mathsf T}\tilde\xi+\tilde K^{\mathsf T}\tilde E\tilde KV=K~Tξ~​+K~TE~K~ on its domain are given by:

  • (I a) K~=K~(0)\tilde K=\tilde K(0)K~=K~(0) if f~′(0)<0\tilde f'(0)<0f~​′(0)<0, K0(0)>0K_0(0)>0K0​(0)>0 and det⁡E~≠0\det\tilde E\neq0detE~=0;
  • (I b) the solutions K~\tilde KK~ of (5.5) if det⁡E~=0\det\tilde E=0detE~=0;
  • (II a) K~=K~(u)\tilde K=\tilde K(u)K~=K~(u) for those uuu with det⁡(E~−ug~)≠0\det(\tilde E-u\tilde g)\neq0det(E~−ug~​)=0, f~′(u)=0\tilde f'(u)=0f~​′(u)=0 and K0(u)>0K_0(u)>0K0​(u)>0;
  • (II b) the solutions K~\tilde KK~ of (5.10) for those uuu with det⁡(E~−ug~)=0\det(\tilde E-u\tilde g)=0det(E~−ug~​)=0;
  • (III) K~=0\tilde K=0K~=0,

where K~(u)=−12(E~−ug~)−1ξ~\tilde K(u)=-\tfrac12(\tilde E-u\tilde g)^{-1}\tilde\xiK~(u)=−21​(E~−ug~​)−1ξ~​ (5.11) and f~′\tilde f'f~​′ is given by (5.17). Cases (I) are the stationary points in the interior K0>∣K∣K_0>|K|K0​>∣K∣ of the domain, cases (II) those on its boundary K0=∣K∣>0K_0=|K|>0K0​=∣K∣>0, where uuu is the Lagrange multiplier, and (III) is the trivial configuration.

Preamble
import Definitions.Def_THDM_stationary
open scoped BigOperators
open Matrix
Formal statement
namespace THDM

theorem thm2_stationary_points
    (xi0 : ℝ) (xi : Fin 3 → ℝ) (eta00 : ℝ) (eta : Fin 3 → ℝ)
    (E : Matrix (Fin 3) (Fin 3) ℝ) (hE : E.IsSymm) (x : Idx → ℝ) :
    IsStatPoint xi0 xi eta00 eta E x ↔
      (-- (I a)
        (RegT eta00 eta E 0 ∧ fTPrime xi0 xi eta00 eta E 0 < 0 ∧
          0 < comp0 (KT xi0 xi eta00 eta E 0) ∧ x = KT xi0 xi eta00 eta E 0) ∨
      -- (I b)
        (¬ RegT eta00 eta E 0 ∧ 0 < comp0 x ∧ 0 < mink x ∧
          ET eta00 eta E *ᵥ x = (-(1 / 2 : ℝ)) • xiT xi0 xi) ∨
      -- (II a)
        (∃ u : ℝ, RegT eta00 eta E u ∧ fTPrime xi0 xi eta00 eta E u = 0 ∧
          0 < comp0 (KT xi0 xi eta00 eta E u) ∧ x = KT xi0 xi eta00 eta E u) ∨
      -- (II b)
        (∃ u : ℝ, ¬ RegT eta00 eta E u ∧ 0 < comp0 x ∧ mink x = 0 ∧
          (ET eta00 eta E - u • gT) *ᵥ x = (-(1 / 2 : ℝ)) • xiT xi0 xi) ∨
      -- (III)
        x = 0) := by sorry

end THDM
Source
M. Maniatis, A. von Manteuffel, O. Nachtmann, F. Nagel, 'Stability and Symmetry Breaking in the General Two-Higgs-Doublet Model', Eur. Phys. J. C 48 (2006) 805-823, arXiv:hep-ph/0605184v3, https://arxiv.org/abs/hep-ph/0605184, Sect. 5, p. 12, Theorem 2 (with eqs. 5.5-5.17)
Read-back

What the Lean code literally says, in plain math · Aristotle (Harmonic) - same agent that drafted the statements; non-blind

Provenance note - this read-back is not independent. It was written by the same agent that drafted the Lean statements of this proposal, at the explicit instruction of the proposal owner, and not by a separate blind auditor. The writer knew what the code was intended to say, so nothing below is independent testimony; it is a self-declaration by the author of the statement. Please audit the Lean code directly rather than relying on this text.

Fix real numbers ξ0,η00\xi_0,\eta_{00}ξ0​,η00​, real 333-tuples ξ,η\xi,\etaξ,η, a real symmetric 3×33\times33×3 matrix EEE, and a four-component real vector xxx whose first component is written x0x_0x0​. Let ξ~=(ξ0,ξ)\tilde\xi=(\xi_0,\xi)ξ~​=(ξ0​,ξ), E~=(η00ηTηE)\tilde E=\begin{pmatrix}\eta_{00}&\eta^{\mathsf T}\\ \eta&E\end{pmatrix}E~=(η00​η​ηTE​), g~=diag(1,−1,−1,−1)\tilde g=\mathrm{diag}(1,-1,-1,-1)g~​=diag(1,−1,−1,−1), m(x)=x02−∑axa2m(x)=x_0^2-\sum_ax_a^2m(x)=x02​−∑a​xa2​, and K~(u)=−12(E~−ug~)−1ξ~\tilde K(u)=-\tfrac12(\tilde E-u\tilde g)^{-1}\tilde\xiK~(u)=−21​(E~−ug~​)−1ξ~​ with f~′(u)=−14ξ~T(E~−ug~)−1g~(E~−ug~)−1ξ~\tilde f'(u)=-\tfrac14\tilde\xi^{\mathsf T}(\tilde E-u\tilde g)^{-1}\tilde g(\tilde E-u\tilde g)^{-1}\tilde\xif~​′(u)=−41​ξ~​T(E~−ug~​)−1g~​(E~−ug~​)−1ξ~​ (a defined expression, not a computed derivative; and at a singular argument the Lean matrix inverse is the zero matrix, so K~(u)=0\tilde K(u)=0K~(u)=0 and f~′(u)=0\tilde f'(u)=0f~​′(u)=0 there).

The assertion is a biconditional between the following two statements about xxx.

Left side - xxx is a stationary point, meaning: x=0x=0x=0; or x0>0x_0>0x0​>0, m(x)>0m(x)>0m(x)>0 and E~x=−12ξ~\tilde Ex=-\tfrac12\tilde\xiE~x=−21​ξ~​; or x0>0x_0>0x0​>0, m(x)=0m(x)=0m(x)=0 and there is a real uuu with (E~−ug~)x=−12ξ~(\tilde E-u\tilde g)x=-\tfrac12\tilde\xi(E~−ug~​)x=−21​ξ~​.

Right side - the disjunction of five cases:

  1. det⁡E~≠0\det\tilde E\neq0detE~=0, f~′(0)<0\tilde f'(0)<0f~​′(0)<0, the first component of K~(0)\tilde K(0)K~(0) is >0>0>0, and x=K~(0)x=\tilde K(0)x=K~(0);
  2. det⁡E~=0\det\tilde E=0detE~=0, x0>0x_0>0x0​>0, m(x)>0m(x)>0m(x)>0, and E~x=−12ξ~\tilde Ex=-\tfrac12\tilde\xiE~x=−21​ξ~​;
  3. there is a real uuu with det⁡(E~−ug~)≠0\det(\tilde E-u\tilde g)\neq0det(E~−ug~​)=0, f~′(u)=0\tilde f'(u)=0f~​′(u)=0, the first component of K~(u)\tilde K(u)K~(u) positive, and x=K~(u)x=\tilde K(u)x=K~(u);
  4. there is a real uuu with det⁡(E~−ug~)=0\det(\tilde E-u\tilde g)=0det(E~−ug~​)=0, x0>0x_0>0x0​>0, m(x)=0m(x)=0m(x)=0, and (E~−ug~)x=−12ξ~(\tilde E-u\tilde g)x=-\tfrac12\tilde\xi(E~−ug~​)x=−21​ξ~​;
  5. x=0x=0x=0.

The five cases are not claimed to be mutually exclusive. Symmetry of EEE is a hypothesis; the domain conditions m(x)≥0m(x)\ge0m(x)≥0, x0≥0x_0\ge0x0​≥0 are not imposed separately on xxx beyond what each case states, and nothing is asserted about whether a stationary point is a minimum, maximum or saddle.

Human review
  • Endorsed by Shuze Chen · Sep 24, 2026

    Confirmed by the moderator at approval.

  • Endorsed by LG · Sep 24, 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