AFTD Auto-Formalizing Theoretical Domains

simplicial_depth_empty

theoremverified

For every point p in the Euclidean plane, the simplicial depth of p with respect to the empty set of points is 0.

Statement

theorem simplicial_depth_empty (p : ℝ × ℝ) : simplicial_depth p ∅ = 0
Source
folklore
Verified
08 Nov 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 2
  • simplicial_depthThe 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 \…
  • two_pow_eq_succ_iffFor a natural d, two to the power d equals d+1 exactly when d is zero or one.

Read back from the Lean

For every point $p \in \mathbb{R} \times \mathbb{R}$, the simplicial depth of $p$ with respect to the empty set of points $\emptyset$ is $0$.

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

The proof, explained

The theorem is proven by expanding the definition of simplicial depth. Because the empty set has no 3-point subsets, no triangles can be formed, so the set of triangles containing the point is empty and its cardinality is zero.

  1. The simplicial depth of p with respect to the empty set is 0.

    Unfolding the definition of simplicial depth (`simplicial_depth`), the goal is to compute the cardinality of the set of 3-element subsets of ∅ \ {p} whose convex hull contains p in its interior. Since ∅ \ {p} is empty, it contains no subsets of size 3, so the set of such triangles is empty and its cardinality is 0. The simplification tactic closes the goal immediately. (The lemma `two_pow_eq_succ_iff` passed to `simpa` comes from an automated search tactic and is not used in the simplification.)

    line 2

    uses simplicial_depth, two_pow_eq_succ_iff

    theorem simplicial_depth_empty (p : ℝ × ℝ) : simplicial_depth p ∅ = 0 := by first | exact two_pow_eq_succ_iff | (apply two_pow_eq_succ_iff <;> assumption) | (apply two_pow_eq_succ_iff <;> simp_all) | simpa using two_pow_eq_succ_iff | (simp only [simplicial_depth] at *; first | exact two_pow_eq_succ_iff | (apply two_pow_eq_succ_iff <;> assumption) | (apply two_pow_eq_succ_iff <;> simp_all) | simpa using two_pow_eq_succ_iff)
simplicial_depth
The simplicial depth of a point p with respect to a finite point set P is the number of 3-element subsets of P \ {p} whose convex hull contains p in its interior.
two_pow_eq_succ_iff
For any natural number d, 2^d = d + 1 if and only if d = 0 or d = 1.

Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.

Lean source view module on GitHub

/-- Sanity lemma: the simplicial depth of any point with respect to the empty set is 0. -/theorem simplicial_depth_empty (p : ℝ × ℝ) : simplicial_depth p ∅ = 0 := by first | exact two_pow_eq_succ_iff | (apply two_pow_eq_succ_iff <;> assumption) | (apply two_pow_eq_succ_iff <;> simp_all) | simpa using two_pow_eq_succ_iff | (simp only [simplicial_depth] at *; first | exact two_pow_eq_succ_iff | (apply two_pow_eq_succ_iff <;> assumption) | (apply two_pow_eq_succ_iff <;> simp_all) | simpa using two_pow_eq_succ_iff)
See it in the graphDiscuss this resultChallenge it