Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Geometric meanings of LP variables

Definition
Kepler_LPGeometricVariables

by Minghui · Sep 27, 2026 · Mathlib c5ea003 (Lean v4.30.0)

discrete-geometrykeplersphere-packing

The ambient space is Euclidean R3\mathbb R^3R3. A finite hypermap HHH consists of a natural number ddd, darts {0,…,d−1}\{0,\ldots,d-1\}{0,…,d−1} and permutations e,n,fe,n,fe,n,f with e(n(f(a)))=ae(n(f(a)))=ae(n(f(a)))=a for every dart. Let Ea,Na,FaE_a,N_a,F_aEa​,Na​,Fa​ be its edge, node and face permutation-cycle orbits, including aaa, and let E,N,F\mathcal E,\mathcal N,\mathcal FE,N,F be the finite sets of distinct such orbits. Let K\mathcal KK be the finite set of distinct components reachable by zero or more applications of e,n,fe,n,fe,n,f. Incident faces at aaa are the distinct sets Ia={Fb:b∈Na}\mathcal I_a=\{F_b:b\in N_a\}Ia​={Fb​:b∈Na​}. Write Ta,Qa,Xa\mathcal T_a,\mathcal Q_a,\mathcal X_aTa​,Qa​,Xa​ for those incident faces of size 333, size 444, and size at least 555, respectively, and (pa,qa,xa)=(∣Ta∣,∣Qa∣,∣Xa∣)(p_a,q_a,x_a)=(|\mathcal T_a|,|\mathcal Q_a|,|\mathcal X_a|)(pa​,qa​,xa​)=(∣Ta​∣,∣Qa​∣,∣Xa​∣). A face list LLL is a finite ordered list of finite lists of natural labels. A face [v0,…,vk−1][v_0,\ldots,v_{k-1}][v0​,…,vk−1​] supplies the cyclic directed pairs (vi,vi+1 mod k)(v_i,v_{i+1\bmod k})(vi​,vi+1modk​); an empty face supplies none, and a singleton supplies a loop. The dart list concatenates these lists with multiplicities. Good means no repeated directed pair, every face nonempty, and each occurring (u,v)(u,v)(u,v) accompanied by (v,u)(v,u)(v,u); it imposes no further length, label-range, connectedness or planarity condition, and the empty list is Good. The list represents HHH if e2=ide^2=\mathrm{id}e2=id and there exists a labeling ℓ\ellℓ of darts by natural numbers such that ℓ(a)=ℓ(b)⇔b∈Na\ell(a)=\ell(b)\Leftrightarrow b\in N_aℓ(a)=ℓ(b)⇔b∈Na​, the map a↦(ℓ(a),ℓ(f(a)))a\mapsto(\ell(a),\ell(f(a)))a↦(ℓ(a),ℓ(f(a))) is injective, (ℓ(e(a)),ℓ(f(e(a))))=(ℓ(f(a)),ℓ(a))(\ell(e(a)),\ell(f(e(a))))=(\ell(f(a)),\ell(a))(ℓ(e(a)),ℓ(f(e(a))))=(ℓ(f(a)),ℓ(a)), every face of LLL is a cyclic rotation of [ℓ(a),ℓ(f(a)),…,ℓ(f∣Fa∣−1(a))][\ell(a),\ell(f(a)),\ldots,\ell(f^{|F_a|-1}(a))][ℓ(a),ℓ(f(a)),…,ℓ(f∣Fa​∣−1(a))] for some dart aaa, and every dart has such a face in LLL. Representation alone permits repeating a face. The opposite hypermap has the same darts and permutations f∘n,n−1,f−1f\circ n,n^{-1},f^{-1}f∘n,n−1,f−1. For an arbitrary placement ppp of the darts in R3\mathbb R^3R3, the representation-label function is one fixed classically chosen witnessing labeling when LLL represents HHH, and the constant-zero labeling otherwise. For any labeling whatsoever, its labeled-position lookup at natural label vvv returns p(a)p(a)p(a) at the least dart number aaa with that label, or the zero vector if none exists. Reflection negates coordinate 000 and keeps coordinates 1,21,21,2. For L,H,pL,H,pL,H,p, the position map q:N→R3q:\mathbb N\to\mathbb R^3q:N→R3 is chosen as follows. If LLL represents HHH, choose a witnessing labeling and return p(a)p(a)p(a) for the first dart, in the order 0,…,d−10,\ldots,d-10,…,d−1, with label vvv, or 000 if the label is missing. If this representation fails but LLL represents the opposite, choose a labeling for the opposite and negate the first Cartesian coordinate of the same first-dart lookup in ppp. If neither representation holds return 000 for every label. The direct representation takes priority if both hold. These are fixed choices, not universal quantification over all representing labelings. For a,u,v∈R3a,u,v\in\mathbb R^3a,u,v∈R3 put Pa(u)=u−⟨u,a⟩a/∥a∥2P_a(u)=u-\langle u,a\rangle a/\|a\|^2Pa​(u)=u−⟨u,a⟩a/∥a∥2, using total division, and let θ\thetaθ be the unoriented Euclidean angle between Pa(u)P_a(u)Pa​(u) and Pa(v)P_a(v)Pa​(v). Define Z(a,u,v)=0Z(a,u,v)=0Z(a,u,v)=0 if a=0a=0a=0 or either projection is zero; otherwise it is 2π−θ2\pi-\theta2π−θ when det⁡(a,u,v)<0\det(a,u,v)<0det(a,u,v)<0 and θ\thetaθ otherwise, including zero determinant with nonzero projections. A variable is a node-kind and natural label, a dart-kind and ordered pair of natural labels, or a face-kind and ordered finite list of such pairs. The following evaluation is defined for every face list L′L'L′ and every map q:N→R3q:\mathbb N\to\mathbb R^3q:N→R3, whether or not they arise from a representation. For a face list L′L'L′ and pair a=(u,v)a=(u,v)a=(u,v), take the pair-list of the first face containing aaa, defaulting to the empty list. Let a+,a−a^+,a^-a+,a− be its next and previous pairs at the first occurrence of aaa, defaulting to aaa if lookup fails, and let a−−=(a−)−a^{--}=(a^-)^-a−−=(a−)−. Put za=Z(q(u),q(v),q((a−)1))z_a=Z(q(u),q(v),q((a^-)_1))za​=Z(q(u),q(v),q((a−)1​)), s0=3arccos⁡(1/3)−πs_0=3\arccos(1/3)-\pis0​=3arccos(1/3)−π, λ(t)=(63−25t)/13\lambda(t)=(63-25t)/13λ(t)=(63−25t)/13 for t≤63/25t\leq63/25t≤63/25 and 000 otherwise, and Rv=1+(s0/π)(1−λ(∥q(v)∥))R_v=1+(s_0/\pi)(1-\lambda(\|q(v)\|))Rv​=1+(s0​/π)(1−λ(∥q(v)∥)). Node variables yn, ln, rho evaluate to ∥q(v)∥,λ(∥q(v)∥),∣Rv∣\|q(v)\|,\lambda(\|q(v)\|),|R_v|∥q(v)∥,λ(∥q(v)∥),∣Rv​∣. Dart variables azim, azim2, azim3 evaluate to za,za+,za−z_a,z_{a^+},z_{a^-}za​,za+​,za−​; rhazim, rhazim2, rhazim3 evaluate to ∣Ra1∣za,∣R(a+)1∣za+,∣R(a−)1∣za−|R_{a_1}|z_a,|R_{(a^+)_1}|z_{a^+},|R_{(a^-)_1}|z_{a^-}∣Ra1​​∣za​,∣R(a+)1​​∣za+​,∣R(a−)1​​∣za−​. Dart variables ye and y6 both give ∥q(u)−q(v)∥\|q(u)-q(v)\|∥q(u)−q(v)∥; y1,y2,y3 give ∥q(u)∥,∥q(v)∥,∥q((a−)1)∥\|q(u)\|,\|q(v)\|,\|q((a^-)_1)\|∥q(u)∥,∥q(v)∥,∥q((a−)1​)∥; y4 and y9 both give the length of a+a^+a+; y5 gives the length of a−a^-a−; y7 gives ∥q((a−−)1)∥\|q((a^{--})_1)\|∥q((a−−)1​)∥; y8 gives the length of a−−a^{--}a−−; and y4prime gives ∥q(v)−q((a−)1)∥\|q(v)-q((a^-)_1)\|∥q(v)−q((a−)1​)∥. For a pair-list FFF, its face sol variable is ∣∑a∈F(za−π)+2π∣|\sum_{a\in F}(z_a-\pi)+2\pi|∣∑a∈F​(za​−π)+2π∣, and its tau variable is ∣∑a∈FzaRa1+(π+s0)(2−∣F∣)∣|\sum_{a\in F}z_aR_{a_1}+(\pi+s_0)(2-|F|)|∣∑a∈F​za​Ra1​​+(π+s0​)(2−∣F∣)∣, counting list multiplicities. A node address is valid if its label occurs in L′L'L′. For dart kinds ye,y1,y2,y6, both endpoint labels must occur but the pair need not; all other dart kinds require the pair itself in the dart list. A face address must equal an occurring face's pair-list exactly, not just up to rotation. The complete node kinds are yn, ln and rho; the complete face kinds are sol and tau; the complete dart kinds are precisely those just listed. List order and repeated pairs affect these functions. Evaluating a variable does not test its address predicate. In particular all missing-dart lookups use the stated fallback, the empty face has sol value 2π2\pi2π and tau value ∣2(π+s0)∣|2(\pi+s_0)|∣2(π+s0​)∣, and empty hypermaps and face lists remain permitted inputs. Decidability of the address predicate supplies a yes/no test for that predicate and no additional geometric assertion.

Source and scope. Primary §9; final formal_lp/hypermap/ineqs/lp_ineqs_defs.hl. Fixed node, dart and face evaluations, including the source absolute-value conventions and opposite-orientation reflection.

Definition code
/-
Flyspeck source material is reproduced and adapted under this license:
MIT License

Copyright (c) 2014 Thomas C. Hales

Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:

The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.

THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.

-/
import Definitions.Def_Kepler_TameArchive
import Definitions.Def_Kepler_GeometricRealization
import Mathlib.Data.List.FinRange

set_option autoImplicit false

namespace KeplerMission.SourceLP

/-- Choose only the node-label witness already present in archive representation.
The fallback is used outside the represented domain and asserts no fact. -/
noncomputable def representationLabels (L : FaceList) (H : FiniteHypermap) :
    Fin H.dartCount → ℕ := by
  classical
  exact if h : L.Represents H then Classical.choose h.2 else fun _ ↦ 0

/-- Fixed first-dart lookup for a node label, with zero at unused labels. -/
def labeledPosition (H : FiniteHypermap) (p : GeometricPlacement H)
    (labels : Fin H.dartCount → ℕ) (v : ℕ) : Space :=
  match (List.finRange H.dartCount).find? (fun d ↦ labels d = v) with
  | some d => p d
  | none => 0

/-- Reflection of coordinate zero, used when the archive represents the opposite
orientation. It preserves lengths and reverses three-dimensional orientation. -/
def reflectPosition (v : Space) : Space :=
  WithLp.toLp 2 (fun i : Fin 3 ↦ if i = 0 then -(v i) else v i)

/-- Fixed source coordinate assignment. Direct representation has priority; otherwise
an opposite representation is reflected. No freely chosen LP assignment is a field. -/
noncomputable def sourcePosition (L : FaceList) (H : FiniteHypermap)
    (p : GeometricPlacement H) (v : ℕ) : Space := by
  classical
  exact if L.Represents H then labeledPosition H p (representationLabels L H) v
    else if L.Represents H.opposite then
      reflectPosition (labeledPosition H p (representationLabels L H.opposite) v)
    else 0

/-- The source ordered face containing an ordered dart. Empty outside valid addresses. -/
def faceDartsOf (L : FaceList) (d : ℕ × ℕ) : List (ℕ × ℕ) :=
  ((L.map FaceList.faceDarts).find? (fun f ↦ d ∈ f)).getD []

/-- Cyclic successor on the explicitly selected face. -/
def nextDart (L : FaceList) (d : ℕ × ℕ) : ℕ × ℕ :=
  let f := faceDartsOf L d
  (f.rotate 1)[f.idxOf d]?.getD d

/-- Cyclic predecessor on the explicitly selected face. -/
def previousDart (L : FaceList) (d : ℕ × ℕ) : ℕ × ℕ :=
  let f := faceDartsOf L d
  (f.rotate (f.length - 1))[f.idxOf d]?.getD d

/-- Source `lp_ineqs_defs.hl` variable categories. -/
inductive NodeQuantity where
  | yn | ln | rho
  deriving DecidableEq, Repr

inductive DartQuantity where
  | azim | azim2 | azim3 | rhazim | rhazim2 | rhazim3
  | ye | y1 | y2 | y3 | y4 | y5 | y6 | y7 | y8 | y9 | y4prime
  deriving DecidableEq, Repr

inductive FaceQuantity where
  | sol | tau
  deriving DecidableEq, Repr

/-- Concrete addresses, not arbitrary real-valued functions or propositions. -/
inductive Variable where
  | node (kind : NodeQuantity) (v : ℕ)
  | dart (kind : DartQuantity) (d : ℕ × ℕ)
  | face (kind : FaceQuantity) (f : List (ℕ × ℕ))
  deriving DecidableEq, Repr

/-- Source `azim_dart`, restricted to the nondegenerate source face-list domain.
The orientation is from the next vertex to the previous vertex about the dart tail.
Any use as an LP variable must prove its source fan/address conditions. -/
noncomputable def dartAzimuth (L : FaceList) (p : ℕ → Space) (d : ℕ × ℕ) : ℝ :=
  geometricAzimuth (p d.1) (p d.2) (p (previousDart L d).1)

noncomputable def radialCoefficient (p : ℕ → Space) (v : ℕ) : ℝ :=
  1 + (regularTetrahedronSolidAngle / Real.pi) * (1 - sourceRadialWeight ‖p v‖)

/-- Source face solid angle and score, each with the source absolute value. -/
noncomputable def faceValue (L : FaceList) (p : ℕ → Space)
    (kind : FaceQuantity) (f : List (ℕ × ℕ)) : ℝ :=
  match kind with
  | .sol => |(f.map (fun d ↦ dartAzimuth L p d - Real.pi)).sum + 2 * Real.pi|
  | .tau => |(f.map (fun d ↦ dartAzimuth L p d * radialCoefficient p d.1)).sum +
      (Real.pi + regularTetrahedronSolidAngle) * (2 - (f.length : ℝ))|

noncomputable def nodeValue (p : ℕ → Space) : NodeQuantity → ℕ → ℝ
  | .yn, v => ‖p v‖
  | .ln, v => sourceRadialWeight ‖p v‖
  | .rho, v => |radialCoefficient p v|

noncomputable def dartValue (L : FaceList) (p : ℕ → Space)
    (kind : DartQuantity) (d : ℕ × ℕ) : ℝ :=
  let next := nextDart L d
  let prev := previousDart L d
  let prev₂ := previousDart L prev
  match kind with
  | .azim => dartAzimuth L p d
  | .azim2 => dartAzimuth L p next
  | .azim3 => dartAzimuth L p prev
  | .rhazim => |radialCoefficient p d.1| * dartAzimuth L p d
  | .rhazim2 => |radialCoefficient p next.1| * dartAzimuth L p next
  | .rhazim3 => |radialCoefficient p prev.1| * dartAzimuth L p prev
  | .ye | .y6 => dist (p d.1) (p d.2)
  | .y1 => ‖p d.1‖
  | .y2 => ‖p d.2‖
  | .y3 => ‖p prev.1‖
  | .y4 | .y9 => dist (p next.1) (p next.2)
  | .y5 => dist (p prev.1) (p prev.2)
  | .y7 => ‖p prev₂.1‖
  | .y8 => dist (p prev₂.1) (p prev₂.2)
  | .y4prime => dist (p d.2) (p prev.1)

noncomputable def Variable.eval (L : FaceList) (p : ℕ → Space) : Variable → ℝ
  | .node kind v => nodeValue p kind v
  | .dart kind d => dartValue L p kind d
  | .face kind f => faceValue L p kind f

/-- Row data must separately validate every address. Distances and endpoint norms
need only existing vertices; quantities using face maps require an actual dart.
Face sums refer to one complete ordered source face, with nodup supplied by Good. -/
def Variable.ValidAddress (L : FaceList) : Variable → Prop
  | .node _ v => v ∈ L.flatten
  | .dart .ye d | .dart .y1 d | .dart .y2 d | .dart .y6 d =>
      d.1 ∈ L.flatten ∧ d.2 ∈ L.flatten
  | .dart _ d => d ∈ L.darts
  | .face _ f => f ∈ L.map FaceList.faceDarts

instance (L : FaceList) (v : Variable) : Decidable (v.ValidAddress L) := by
  cases v with
  | node kind v => unfold Variable.ValidAddress; infer_instance
  | dart kind d => cases kind <;> unfold Variable.ValidAddress <;> infer_instance
  | face kind f => unfold Variable.ValidAddress; infer_instance

end KeplerMission.SourceLP
Source
Hales et al. (2017), A Formal Proof of the Kepler Conjecture, https://doi.org/10.1017/fmp.2017.1; Primary §9; final formal_lp/hypermap/ineqs/lp_ineqs_defs.hl. Fixed node, dart and face evaluations, including the source absolute-value conventions and opposite-orientation reflection.; https://github.com/flyspeck/flyspeck/tree/1ce0353008eba83d3c76ae9a25c3c242e4802d53
Read-back

What the Lean code literally says, in plain math · gpt-6

The ambient space is Euclidean R3\mathbb R^3R3. A finite hypermap HHH consists of a natural number ddd, darts {0,…,d−1}\{0,\ldots,d-1\}{0,…,d−1} and permutations e,n,fe,n,fe,n,f with e(n(f(a)))=ae(n(f(a)))=ae(n(f(a)))=a for every dart. Let Ea,Na,FaE_a,N_a,F_aEa​,Na​,Fa​ be its edge, node and face permutation-cycle orbits, including aaa, and let E,N,F\mathcal E,\mathcal N,\mathcal FE,N,F be the finite sets of distinct such orbits. Let K\mathcal KK be the finite set of distinct components reachable by zero or more applications of e,n,fe,n,fe,n,f. Incident faces at aaa are the distinct sets Ia={Fb:b∈Na}\mathcal I_a=\{F_b:b\in N_a\}Ia​={Fb​:b∈Na​}. Write Ta,Qa,Xa\mathcal T_a,\mathcal Q_a,\mathcal X_aTa​,Qa​,Xa​ for those incident faces of size 333, size 444, and size at least 555, respectively, and (pa,qa,xa)=(∣Ta∣,∣Qa∣,∣Xa∣)(p_a,q_a,x_a)=(|\mathcal T_a|,|\mathcal Q_a|,|\mathcal X_a|)(pa​,qa​,xa​)=(∣Ta​∣,∣Qa​∣,∣Xa​∣). A face list LLL is a finite ordered list of finite lists of natural labels. A face [v0,…,vk−1][v_0,\ldots,v_{k-1}][v0​,…,vk−1​] supplies the cyclic directed pairs (vi,vi+1 mod k)(v_i,v_{i+1\bmod k})(vi​,vi+1modk​); an empty face supplies none, and a singleton supplies a loop. The dart list concatenates these lists with multiplicities. Good means no repeated directed pair, every face nonempty, and each occurring (u,v)(u,v)(u,v) accompanied by (v,u)(v,u)(v,u); it imposes no further length, label-range, connectedness or planarity condition, and the empty list is Good. The list represents HHH if e2=ide^2=\mathrm{id}e2=id and there exists a labeling ℓ\ellℓ of darts by natural numbers such that ℓ(a)=ℓ(b)⇔b∈Na\ell(a)=\ell(b)\Leftrightarrow b\in N_aℓ(a)=ℓ(b)⇔b∈Na​, the map a↦(ℓ(a),ℓ(f(a)))a\mapsto(\ell(a),\ell(f(a)))a↦(ℓ(a),ℓ(f(a))) is injective, (ℓ(e(a)),ℓ(f(e(a))))=(ℓ(f(a)),ℓ(a))(\ell(e(a)),\ell(f(e(a))))=(\ell(f(a)),\ell(a))(ℓ(e(a)),ℓ(f(e(a))))=(ℓ(f(a)),ℓ(a)), every face of LLL is a cyclic rotation of [ℓ(a),ℓ(f(a)),…,ℓ(f∣Fa∣−1(a))][\ell(a),\ell(f(a)),\ldots,\ell(f^{|F_a|-1}(a))][ℓ(a),ℓ(f(a)),…,ℓ(f∣Fa​∣−1(a))] for some dart aaa, and every dart has such a face in LLL. Representation alone permits repeating a face. The opposite hypermap has the same darts and permutations f∘n,n−1,f−1f\circ n,n^{-1},f^{-1}f∘n,n−1,f−1. For an arbitrary placement ppp of the darts in R3\mathbb R^3R3, the representation-label function is one fixed classically chosen witnessing labeling when LLL represents HHH, and the constant-zero labeling otherwise. For any labeling whatsoever, its labeled-position lookup at natural label vvv returns p(a)p(a)p(a) at the least dart number aaa with that label, or the zero vector if none exists. Reflection negates coordinate 000 and keeps coordinates 1,21,21,2. For L,H,pL,H,pL,H,p, the position map q:N→R3q:\mathbb N\to\mathbb R^3q:N→R3 is chosen as follows. If LLL represents HHH, choose a witnessing labeling and return p(a)p(a)p(a) for the first dart, in the order 0,…,d−10,\ldots,d-10,…,d−1, with label vvv, or 000 if the label is missing. If this representation fails but LLL represents the opposite, choose a labeling for the opposite and negate the first Cartesian coordinate of the same first-dart lookup in ppp. If neither representation holds return 000 for every label. The direct representation takes priority if both hold. These are fixed choices, not universal quantification over all representing labelings. For a,u,v∈R3a,u,v\in\mathbb R^3a,u,v∈R3 put Pa(u)=u−⟨u,a⟩a/∥a∥2P_a(u)=u-\langle u,a\rangle a/\|a\|^2Pa​(u)=u−⟨u,a⟩a/∥a∥2, using total division, and let θ\thetaθ be the unoriented Euclidean angle between Pa(u)P_a(u)Pa​(u) and Pa(v)P_a(v)Pa​(v). Define Z(a,u,v)=0Z(a,u,v)=0Z(a,u,v)=0 if a=0a=0a=0 or either projection is zero; otherwise it is 2π−θ2\pi-\theta2π−θ when det⁡(a,u,v)<0\det(a,u,v)<0det(a,u,v)<0 and θ\thetaθ otherwise, including zero determinant with nonzero projections. A variable is a node-kind and natural label, a dart-kind and ordered pair of natural labels, or a face-kind and ordered finite list of such pairs. The following evaluation is defined for every face list L′L'L′ and every map q:N→R3q:\mathbb N\to\mathbb R^3q:N→R3, whether or not they arise from a representation. For a face list L′L'L′ and pair a=(u,v)a=(u,v)a=(u,v), take the pair-list of the first face containing aaa, defaulting to the empty list. Let a+,a−a^+,a^-a+,a− be its next and previous pairs at the first occurrence of aaa, defaulting to aaa if lookup fails, and let a−−=(a−)−a^{--}=(a^-)^-a−−=(a−)−. Put za=Z(q(u),q(v),q((a−)1))z_a=Z(q(u),q(v),q((a^-)_1))za​=Z(q(u),q(v),q((a−)1​)), s0=3arccos⁡(1/3)−πs_0=3\arccos(1/3)-\pis0​=3arccos(1/3)−π, λ(t)=(63−25t)/13\lambda(t)=(63-25t)/13λ(t)=(63−25t)/13 for t≤63/25t\leq63/25t≤63/25 and 000 otherwise, and Rv=1+(s0/π)(1−λ(∥q(v)∥))R_v=1+(s_0/\pi)(1-\lambda(\|q(v)\|))Rv​=1+(s0​/π)(1−λ(∥q(v)∥)). Node variables yn, ln, rho evaluate to ∥q(v)∥,λ(∥q(v)∥),∣Rv∣\|q(v)\|,\lambda(\|q(v)\|),|R_v|∥q(v)∥,λ(∥q(v)∥),∣Rv​∣. Dart variables azim, azim2, azim3 evaluate to za,za+,za−z_a,z_{a^+},z_{a^-}za​,za+​,za−​; rhazim, rhazim2, rhazim3 evaluate to ∣Ra1∣za,∣R(a+)1∣za+,∣R(a−)1∣za−|R_{a_1}|z_a,|R_{(a^+)_1}|z_{a^+},|R_{(a^-)_1}|z_{a^-}∣Ra1​​∣za​,∣R(a+)1​​∣za+​,∣R(a−)1​​∣za−​. Dart variables ye and y6 both give ∥q(u)−q(v)∥\|q(u)-q(v)\|∥q(u)−q(v)∥; y1,y2,y3 give ∥q(u)∥,∥q(v)∥,∥q((a−)1)∥\|q(u)\|,\|q(v)\|,\|q((a^-)_1)\|∥q(u)∥,∥q(v)∥,∥q((a−)1​)∥; y4 and y9 both give the length of a+a^+a+; y5 gives the length of a−a^-a−; y7 gives ∥q((a−−)1)∥\|q((a^{--})_1)\|∥q((a−−)1​)∥; y8 gives the length of a−−a^{--}a−−; and y4prime gives ∥q(v)−q((a−)1)∥\|q(v)-q((a^-)_1)\|∥q(v)−q((a−)1​)∥. For a pair-list FFF, its face sol variable is ∣∑a∈F(za−π)+2π∣|\sum_{a\in F}(z_a-\pi)+2\pi|∣∑a∈F​(za​−π)+2π∣, and its tau variable is ∣∑a∈FzaRa1+(π+s0)(2−∣F∣)∣|\sum_{a\in F}z_aR_{a_1}+(\pi+s_0)(2-|F|)|∣∑a∈F​za​Ra1​​+(π+s0​)(2−∣F∣)∣, counting list multiplicities. A node address is valid if its label occurs in L′L'L′. For dart kinds ye,y1,y2,y6, both endpoint labels must occur but the pair need not; all other dart kinds require the pair itself in the dart list. A face address must equal an occurring face's pair-list exactly, not just up to rotation. The complete node kinds are yn, ln and rho; the complete face kinds are sol and tau; the complete dart kinds are precisely those just listed. List order and repeated pairs affect these functions. Evaluating a variable does not test its address predicate. In particular all missing-dart lookups use the stated fallback, the empty face has sol value 2π2\pi2π and tau value ∣2(π+s0)∣|2(\pi+s_0)|∣2(π+s0​)∣, and empty hypermaps and face lists remain permitted inputs. Decidability of the address predicate supplies a yes/no test for that predicate and no additional geometric assertion.

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

    Confirmed by the moderator at approval.

  • Endorsed by Minghui · Sep 27, 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