AFTD Auto-Formalizing Theoretical Domains

simplicial_depth

def

The simplicial depth SD(p, P) of a point p with respect to a finite set P in the Euclidean plane is the number of 3-element subsets of P \ {p} whose open triangle contains p.

Statement

noncomputable def simplicial_depth (p : ℝ × ℝ) (P : Finset (ℝ × ℝ)) : ℕ
Defined in
arXiv:2610.38658, Definition 19
Verified
08 Nov 2026
Axioms
none listed
Used by 3
  • total_simplicial_depth_eq_sum_powersetCard_fourThe total simplicial depth of a finite point set P in the Euclidean plane is the sum over all 4-element subsets Q of P of the total…
  • simplicial_depth_emptyFor every point p in the Euclidean plane, the simplicial depth of p with respect to the empty set of points is 0.
  • total_simplicial_depthThe total simplicial depth TSD(P) of a finite point set P in the Euclidean plane is the sum over all points p in P of the simplicial depth…

Read back from the Lean

The function simplicial_depth takes a point p : ℝ × ℝ and a finite set of points P : Finset (ℝ × ℝ) and returns the number (as a natural number) of 3-element subsets T of P \ {p} such that p lies in the topological interior of the convex hull of T in ℝ × ℝ.

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

Lean source view module on GitHub

/-- Simplicial depth of a point p with respect to a finite set P in ℝ². -/
noncomputable def simplicial_depth (p : ℝ × ℝ) (P : Finset (ℝ × ℝ)) : ℕ := open Classical in (((P.erase p).powersetCard 3).filter (fun (T : Finset (ℝ × ℝ)) => p ∈ interior (convexHull ℝ (T : Set (ℝ × ℝ))))).card
See it in the graphDiscuss this resultChallenge it