`BookProof.ChapterFreeFieldBornFiberStabilizer.posSupport_bornMap` (x : EuclideanSpace ℝ (Fin n)) : posSupport (bornMap x) = Finset.univ.filter (fun k => x k ≠ 0)

Proved

BookProof.ChapterFreeFieldBornFiberStabilizer.posSupport_bornMap

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

theoremstimepiece

Prove the following Lean 4 theorem from ChapterFreeFieldBornFiberStabilizer.

BookProof.ChapterFreeFieldBornFiberStabilizer.posSupport_bornMap (x : EuclideanSpace ℝ (Fin n)) : posSupport (bornMap x) = Finset.univ.filter (fun k => x k ≠ 0)

Formalization note: Lean 4 identifier BookProof.ChapterFreeFieldBornFiberStabilizer.posSupport_bornMap.

Preamble

-- Generated from ChapterFreeFieldBornFiberStabilizer.lean — theorem BookProof.ChapterFreeFieldBornFiberStabilizer.posSupport_bornMap
import Definitions.Def_ChapterFreeFieldBorn
import Definitions.Def_ChapterFreeFieldBornQuotient
import Definitions.Def_ChapterFreeFieldBornSignGauge
import Definitions.Def_ChapterFreeFieldBornFiberCardGeneral
import Definitions.Def_ChapterFreeFieldBornFiberBounds
import Mathlib
import Definitions.Def_ChapterFreeFieldBornFiberStabilizer
open BookProof.ChapterFreeFieldBornFiberStabilizer


open MeasureTheory
open BookProof.ChapterFreeFieldBorn
open BookProof.ChapterFreeFieldBornQuotient
open BookProof.ChapterFreeFieldBornSignGauge
open BookProof.ChapterFreeFieldBornFiberCardGeneral
open BookProof.ChapterFreeFieldBornFiberBounds


variable {n : ℕ}

Formal statement

theorem BookProof.ChapterFreeFieldBornFiberStabilizer.posSupport_bornMap (x : EuclideanSpace ℝ (Fin n)) :
    posSupport (bornMap x) = Finset.univ.filter (fun k => x k ≠ 0) := by sorry

View graph