**The intersection lattice of the braid arrangement in `ℝ^n` has `Nat.bell n`
ProvedGeometry.KernelPatterns.card_braidFlats_eq_bellaether-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