AFTD Auto-Formalizing Theoretical Domains

mutual_visibility_number

def

The mutual-visibility number of a finite graph G is the maximum size of a mutual-visibility set of vertices in G.

Statement

noncomputable def mutual_visibility_number {V : Type*} [Fintype V] (G : SimpleGraph V) : ℕ
Defined in
arXiv:2611.09513, Section 1
Verified
09 Nov 2026
Axioms
none listed
Built on 1
  • is_mutual_visibility_setA set S of vertices in a simple graph G is a mutual-visibility set if for every two distinct vertices u, v in S, there exists a shortest…

Read back from the Lean

Given a finite type V and a simple graph G on V, mutual_visibility_number G is defined as the supremum (in ℕ) of the set of all natural numbers n such that there exists a finite subset s of V of cardinality n which is a mutual visibility set in G (that is, for every pair of distinct vertices u, v ∈ s, there exists a walk p from u to v in G of length equal to G.dist u v such that no internal vertex on p belongs to s).

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

/-- The mutual-visibility number of a finite simple graph is the maximum cardinality of a mutual-visibility set. -/
noncomputable def mutual_visibility_number {V : Type*} [Fintype V] (G : SimpleGraph V) : ℕ := sSup {n | ∃ s : Finset V, is_mutual_visibility_set G (s : Set V) ∧ s.card = n}
See it in the graphDiscuss this resultChallenge it