Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 10 — Coning commutes with boundary

Open
TwoReLULayers.DepthCollapse.Supplement.realization_boundary

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≥0n\ge0n≥0, fix arbitrary orientations of all edges of the standard nnn-simplex, and let k≥2k\ge2k≥2. For every formal cubical chain x∈Cknx\in C_k^nx∈Ckn​,

dPρ(x)=ρ(dCx).d_P\rho(x)=\rho(d_Cx).dP​ρ(x)=ρ(dC​x).

The quantifier includes geometrically degenerate formal generators. This gives the compatibility between the cubical boundary and the geometric paramid realization in precisely the degrees used by the construction.

Differences from the source:

  • encoding: Rational polytopes in oriented subspaces, with Minkowski differences modulo translations and lower-dimensional terms → Finite rational vertex and ordered-frame presentation of the same geometric quotient; reason: The presentation imposes exactly those geometric relations; facet boundaries are evaluated on a chosen representative, with no extra hypothesis
  • encoding: Group algebra tensored with the exterior power of the formally labeled simplex edges → Finite rational support on lattice points and increasing edge-label subsets; reason: This is its canonical basis presentation; dependent geometric edge vectors are not identified
  • encoding: k ≥ 2 → k = m+2, m : ℕ; reason: Equivalent enumeration of every permitted natural dimension or degree; avoids dependent transports from natural subtraction
  • encoding: Simplex vertices labeled 1,…,n+1 → Simplex vertices labeled 0,…,n; reason: Only labels change; actual vertices, edges and facet cardinalities are the same
Preamble
import Definitions.Def_TwoReLULayers_DepthCollapse_Supplement_Realization
Formal statement
namespace TwoReLULayers.DepthCollapse.Supplement

/-- Lemma 10, p.15. Degree k+2 ranges over every degree ≥2. -/
theorem realization_boundary (n k : ℕ) (o : EdgeOrientations n) (x : C n (k + 2)) :
    dP n (k + 3) (rho o x) = rho o (dC o x) := by sorry

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, Lemma 10.

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