Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Definition 9 — demand hitting

Definition
DistancePreserver934_Exact_Supplement_Hitting

by mikedeng1 · Nov 15, 2026 · Mathlib 0df444a (Lean v4.33.1)

additive-spannersdistance-preserversgraph-theoryp2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-v1

A vertex uuu hits a demand qqq in HHH if an edge e∈E(H)e\in E(H)e∈E(H) is essential to qqq and one of its endpoints x∈ex\in ex∈e is adjacent to uuu in HHH. A set SSS hits QQQ when

∀q∈Q  ∃u∈S  ∃e∈E(H)  ∃x∈e: ux∈E(H) and e is essential to q.\forall q\in Q\;\exists u\in S\;\exists e\in E(H)\;\exists x\in e:\ ux\in E(H)\text{ and }e\text{ is essential to }q.∀q∈Q∃u∈S∃e∈E(H)∃x∈e: ux∈E(H) and e is essential to q.

Essentiality is the published predicate quantifying over every shortest walk in the current graph. Hitting differs from covering by the extra adjacency; it includes no private-edge, density or length hypothesis.

Definition code
import Definitions.Def_DistancePreserver934_Exact_Essential

set_option autoImplicit false

namespace DistancePreserver934.Exact.Supplement

open Classical

/-- Definition 9: one adjacency from a vertex to an endpoint of an essential edge. -/
def Hits {V : Type} (H : SimpleGraph V) (u : V) (q : Sym2 V) : Prop :=
  ∃ e ∈ H.edgeSet, ∃ x ∈ e, H.Adj u x ∧ IsEssential H q e

/-- Every demand has a hitting tuple whose first vertex lies in S. -/
def HitsAll {V : Type} (H : SimpleGraph V) (S : Finset V) (Q : Finset (Sym2 V)) : Prop :=
  ∀ q ∈ Q, ∃ u ∈ S, Hits H u q

end DistancePreserver934.Exact.Supplement
Source
Yanyu Chen, Yu Chen, Zihan Tan, Mingyang Yang, Improved Bounds on Distance Preservers, STOC 2027 submission #934 (October 2026); canonical source.pdf SHA-256 79b3d23a6e7b7fc6148c7a627181474a0129fb2f4c1d04ccd94c1da7987ed76b; Definition 9, printed p. 13 (PDF p. 14)

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me