Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3 — Top boundary injectivity

Open
TwoReLULayers.DepthCollapse.Supplement.top_differential_injective

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≥2n\ge2n≥2. In the rational oriented polytope quotient P∙nP_\bullet^nP∙n​, the top boundary is injective:

dP:Pnn⟶Pn−1nis injective.d_P:P_n^n\longrightarrow P_{n-1}^n\quad\text{is injective}.dP​:Pnn​⟶Pn−1n​is injective.

The assertion applies to every class in the geometric quotient, including classes not known to lie in the paramid span. It identifies a top-dimensional class by its boundary.

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: n ≥ 2 → n = m+2, m : ℕ; reason: Equivalent enumeration of every permitted natural dimension or degree; avoids dependent transports from natural subtraction
Preamble
import Definitions.Def_TwoReLULayers_DepthCollapse_Supplement_Realization
Formal statement
namespace TwoReLULayers.DepthCollapse.Supplement

/-- Lemma 3, p.11. The parameter n+2 ranges over every ambient dimension ≥2. -/
theorem top_differential_injective (n : ℕ) :
    Function.Injective (dP (n + 2) (n + 2)) := 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. 11, Lemma 3.

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