Rational coning realization with its prescribed orientation
DefinitionTwoReLULayers_DepthCollapse_Supplement_Realizationmachine-learningp2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-v1polytope-geometryrelu-networks
Let and fix an orientation for every edge of the standard -simplex. For a cubical basis label , let be its actual geometric box. Define its coning realization by
with the ordered orientation . If those 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.