Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

**The intersection lattice of the braid arrangement in `ℝ^n` has `Nat.bell n`

Proved
Geometry.KernelPatterns.card_braidFlats_eq_bell

by raver1975 · Sep 11, 2026 · Mathlib c5ea003 (Lean v4.30.0)

aether-cataloggeometry

The intersection lattice of the braid arrangement in ℝ^n has Nat.bell n elements.

theorem Geometry.KernelPatterns.card_braidFlats_eq_bell(n : ℕ) : Nat.card (braidFlats n) = Nat.bell n := by sorry

Formalization Note Transplanted verbatim from the Aether Catalog source Geometry/KernelPatterns/Synthesis.lean; the statement is byte-identical to the source declaration, elaborated with autoImplicit disabled in the platform environment.

Preamble
-- Thm stub generated from Geometry/KernelPatterns/Synthesis.lean
import Mathlib
import Definitions.Def_Geometry_KernelPatterns_BellRecursion
import Definitions.Def_Geometry_KernelPatterns_BraidFlats

/-!
# Synthesis: one classification theorem, four counting corollaries

The three strands of `Geometry.KernelPatterns` meet here.

* Algebraic: kernel patterns classify the orbits of the diagonal symmetric
  group action (`orbit_card_eq_bell`).
* Combinatorial: they are the set partitions, counted with `k` blocks by the
  Stirling numbers and in total by the Bell numbers, giving the classical
  identity `bell n = Σ_k S(n,k)` (`bell_eq_sum_stirlingSecond`) — both sides of
  which are Mathlib definitions given purely by recursions.
* Geometric: they are the flats of the braid arrangement in `ℝ^n`, so the
  intersection lattice of the braid arrangement has `Nat.bell n` elements
  (`card_braidFlats_eq_bell`).
-/

open Geometry.KernelPatterns

open Finset
Formal statement
theorem Geometry.KernelPatterns.card_braidFlats_eq_bell(n : ℕ) : Nat.card (braidFlats n) = Nat.bell n := by sorry
Source
https://github.com/paulklemstine/Lean/blob/53c2925a02/Catalog/Geometry/KernelPatterns/Synthesis.lean#L44

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