`BookProof.ChapterFreeFieldBornFiberSpectrum.exists_bornFiber_card_eq_two_pow` {k : ℕ} (hk : 1 ≤ k) (hkn : k ≤ n) : ∃ p : ↥(stdSimplex ℝ (Fin n)), Nat.card ↥(bornMapSphere n ⁻¹' {p

Proved

BookProof.ChapterFreeFieldBornFiberSpectrum.exists_bornFiber_card_eq_two_pow

by leonardopedro · Oct 16, 2026 · Mathlib 0df444a (Lean v4.33.1)

theoremstimepiece

Prove the following Lean 4 theorem from ChapterFreeFieldBornFiberSpectrum.

BookProof.ChapterFreeFieldBornFiberSpectrum.exists_bornFiber_card_eq_two_pow {k : ℕ} (hk : 1 ≤ k) (hkn : k ≤ n) : ∃ p : ↥(stdSimplex ℝ (Fin n)), Nat.card ↥(bornMapSphere n ⁻¹' {p}) = 2 ^ k

Formalization note: Lean 4 identifier BookProof.ChapterFreeFieldBornFiberSpectrum.exists_bornFiber_card_eq_two_pow.

Preamble

-- Generated from ChapterFreeFieldBornFiberSpectrum.lean — theorem BookProof.ChapterFreeFieldBornFiberSpectrum.exists_bornFiber_card_eq_two_pow
import Definitions.Def_ChapterFreeFieldBorn
import Definitions.Def_ChapterFreeFieldBornSurj
import Definitions.Def_ChapterFreeFieldBornCont
import Definitions.Def_ChapterFreeFieldBornQuotient
import Definitions.Def_ChapterFreeFieldBornFiberCardGeneral
import Definitions.Def_ChapterFreeFieldBornFiberTwo
import Definitions.Def_ChapterFreeFieldBornFiberBounds
import Mathlib
import Definitions.Def_ChapterFreeFieldBornFiberSpectrum
open BookProof.ChapterFreeFieldBornFiberSpectrum


open MeasureTheory
open BookProof.ChapterFreeFieldBorn BookProof.ChapterFreeFieldBornSurj
open BookProof.ChapterFreeFieldBornCont BookProof.ChapterFreeFieldBornQuotient
open BookProof.ChapterFreeFieldBornFiberCardGeneral
open BookProof.ChapterFreeFieldBornFiberTwo
open BookProof.ChapterFreeFieldBornFiberBounds


variable {n : ℕ}

Formal statement

theorem BookProof.ChapterFreeFieldBornFiberSpectrum.exists_bornFiber_card_eq_two_pow {k : ℕ} (hk : 1 ≤ k) (hkn : k ≤ n) :
    ∃ p : ↥(stdSimplex ℝ (Fin n)),
      Nat.card ↥(bornMapSphere n ⁻¹' {p}) = 2 ^ k := by sorry

View graph