Documentation

LeanPool.CarlsonFunctions.StdSimplexMeasure.PositiveSimplex.Basic

Solid simplex geometry and volume #

def posSimplexFin (n : ℕ) (r : ℝ) :
Set (Fin n → ℝ)

The positive simplex of radius r in coordinates indexed by Fin n: nonnegative vectors whose coordinate sum is at most r.

Equations
Instances For

    The finite-coordinate positive simplex is measurable.

    The volume formula for the zero-dimensional positive simplex.

    def posSimplexFinSuccSlices (n : ℕ) (r : ℝ) :
    Set (ℝ × (Fin n → ℝ))

    The product-coordinate presentation of posSimplexFin (n + 1) r, obtained by separating the zeroth coordinate.

    Equations
    Instances For

      The product-coordinate presentation of a positive simplex is measurable.

      theorem image_posSimplexFin_piFinSuccAbove (n : ℕ) (r : ℝ) :
      have e := MeasurableEquiv.piFinSuccAbove (fun (x : Fin (n + 1)) => ℝ) 0; ⇑e '' posSimplexFin (n + 1) r = posSimplexFinSuccSlices n r

      Separating the zeroth coordinate maps a positive (n + 1)-simplex to its product-coordinate presentation.

      A slice of the product-coordinate presentation at t ∈ [0, r] is the positive simplex of radius r - t.

      Outside [0, r], the slices in the product-coordinate presentation are empty.

      theorem lintegral_Icc_sub_pow_div_factorial (n : ℕ) (r : ℝ) (hr : 0 ≤ r) :
      ∫⁻ (t : ℝ) in Set.Icc 0 r, ENNReal.ofReal (r - t) ^ n / ↑n.factorial = ENNReal.ofReal r ^ (n + 1) / ↑(n + 1).factorial

      The one-dimensional integral used in the positive-simplex volume induction.

      theorem volume_posSimplexFin_succ (n : ℕ) (ih : ∀ (r : ℝ), 0 ≤ r → MeasureTheory.volume (posSimplexFin n r) = ENNReal.ofReal r ^ n / ↑n.factorial) (r : ℝ) (hr : 0 ≤ r) :

      The induction step for the volume of a positive simplex, obtained by slicing off its first coordinate.

      The n-dimensional volume of the positive simplex of radius r is r ^ n / n!.

      def posSimplex (α : Type u_1) [Fintype α] (r : ℝ) :
      Set (α → ℝ)

      The positive simplex of radius r indexed by an arbitrary finite type: nonnegative vectors whose coordinate sum is at most r.

      Equations
      Instances For
        def posSimplexSlices {α : Type u_1} [Fintype α] (i : α) (r : ℝ) :
        Set (ℝ × ({ j : α // j ≠ i } → ℝ))

        The product-coordinate presentation of a positive simplex obtained by separating the coordinate i.

        Equations
        Instances For
          theorem posSimplex_eq_empty_of_neg {α : Type u_1} [Fintype α] {r : ℝ} (hr : r < 0) :

          A positive simplex of negative radius is empty.

          theorem measurableSet_posSimplex (α : Type u_1) [Fintype α] (r : ℝ) :

          A positive simplex is measurable.

          theorem image_posSimplex_funSplitAt {α : Type u_1} [Fintype α] (i : α) (r : ℝ) :

          Separating one coordinate identifies a positive simplex with its product-coordinate presentation.

          theorem measurableSet_posSimplexSlices {α : Type u_1} [Fintype α] (i : α) (r : ℝ) :

          The product-coordinate presentation of a positive simplex is measurable.

          theorem preimage_posSimplexSlices_of_mem {α : Type u_1} [Fintype α] (i : α) (r t : ℝ) (ht : t ∈ Set.Icc 0 r) :

          A slice of posSimplexSlices i r at a point of [0, r] is the positive simplex of radius r - t in the remaining coordinates.

          theorem preimage_posSimplexSlices_eq_empty_of_not_mem {α : Type u_1} [Fintype α] (i : α) (r t : ℝ) (ht : t ∉ Set.Icc 0 r) :

          Outside [0, r], every slice of posSimplexSlices i r is empty.

          The volume of the positive simplex indexed by α is r ^ Fintype.card α / (Fintype.card α)!.

          theorem volume_posSimplex_toReal (α : Type u_1) [Fintype α] (r : ℝ) (hr : 0 ≤ r) :

          Real-valued form of the positive-simplex volume formula.