Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Rational coning realization with its prescribed orientation

Definition
TwoReLULayers_DepthCollapse_Supplement_Realization

by mikedeng1 · Nov 15, 2026 · Mathlib 0df444a (Lean v4.33.1)

machine-learningp2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-v1polytope-geometryrelu-networks

Let n,k≥0n,k\ge0n,k≥0 and fix an orientation for every edge of the standard nnn-simplex. For a cubical basis label (γ,{i1<⋯<ik})(\gamma,\{i_1<\cdots<i_k\})(γ,{i1​<⋯<ik​}), let B=γ+∑j[0,tij]B=\gamma+\sum_j[0,t_{i_j}]B=γ+∑j​[0,tij​​] be its actual geometric box. Define its coning realization by

ρ(γ⊗ei1∧⋯∧eik)=[conv⁡({0}∪B)]∈Pk+1n,\rho(\gamma\otimes e_{i_1}\wedge\cdots\wedge e_{i_k})= [\operatorname{conv}(\{0\}\cup B)]\in P_{k+1}^n,ρ(γ⊗ei1​​∧⋯∧eik​​)=[conv({0}∪B)]∈Pk+1n​,

with the ordered orientation ti1∧⋯∧tik∧γt_{i_1}\wedge\cdots\wedge t_{i_k}\wedge\gammati1​​∧⋯∧tik​​∧γ. If those k+1k+1k+1 vectors are dependent, the class is zero by the explicit invalid-frame relation of the geometric quotient. The formal cubical generator itself is retained. Extend by finite rational linear combinations.

This is the actual coning map from formal cubes to geometric paramids. Its definition does not assume commutation with the boundary, surjectivity onto the paramid span, or a coning preimage of the simplex.

Definition code
import Definitions.Def_TwoReLULayers_DepthCollapse_Supplement_Cubical

namespace TwoReLULayers.DepthCollapse.Supplement

noncomputable section
attribute [local instance] Classical.propDecidable Classical.decEq

/-- The ordered geometric frame is tᵢ₁,...,tᵢₖ,γ, with γ last. -/
def coneFrame {n k : ℕ} (o : EdgeOrientations n) (b : CubeLabel n k) :
    Fin (k + 1) → QSpace n :=
  Fin.snoc (fun j => rationalLattice (edgeZ o (b.2.val.orderEmbOfFin b.2.property j)))
    (rationalLattice b.1)

/-- Actual rational cone conv({0} ∪ box); dependent frames give zero in the
geometric quotient by its invalid-frame relation, without killing the cube itself. -/
def coneClass {n k : ℕ} (o : EdgeOrientations n) (b : CubeLabel n k) : P n (k + 1) :=
  polyClass ⟨coneFrame o b, insert 0 (cubeVertices o b)⟩

def rho {n k : ℕ} (o : EdgeOrientations n) (x : C n k) : P n (k + 1) :=
  x.sum (fun b q => q • coneClass o b)

end
end TwoReLULayers.DepthCollapse.Supplement
Source
Kilian Rueß, Florestan Brunck, Christoph Hertrich, Jack Stade, Amir Yehudayoff, Two ReLU layers is all you need, STOC 2027 submission #980 (October 2026). Use this pinned PDF and its own labels; no arXiv version is asserted. p. 15, Section 3.1.

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