AFTD Auto-Formalizing Theoretical Domains

shannon_or_capacity

def

The Shannon OR-capacity C_OR(G) of a simple graph G is defined as the supremum over n ≥ 1 of (omega(G^{∨n}))^{1/n}, where omega denotes the clique number.

Statement

noncomputable def shannon_or_capacity {V : Type*} (G : SimpleGraph V) : ℝ
Defined in
arXiv:2610.41977 eq. (1.1)
Verified
03 Nov 2026
Axioms
none listed
Built on 1
  • simple_graph_or_powerThe n-th OR-power (co-normal power) G^{∨n} of a simple graph G has vertex set Fin n → V, with an edge between two functions if they are…
Used by 5

Read back from the Lean

Given a type V and a simple graph G on V, shannon_or_capacity G is defined as the supremum in ℝ over all natural numbers n such that 1 ≤ n of ((simple_graph_or_power G n).cliqueNum : ℝ) ^ ((1 : ℝ) / n). Here, for each n : ℕ, simple_graph_or_power G n is the simple graph whose vertices are functions x : Fin n → V, where two vertices x and y are adjacent if and only if there exists some index i : Fin n such that x i and y i are adjacent in G. The quantity being maximized is the n-th root of the clique number of this OR-power graph.

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 Shannon OR-capacity of a simple graph. -/
noncomputable def shannon_or_capacity {V : Type*} (G : SimpleGraph V) : ℝ := ⨆ (n : ℕ) (_ : 1 ≤ n), (((simple_graph_or_power G n).cliqueNum : ℝ) ^ ((1 : ℝ) / n))
See it in the graphDiscuss this resultChallenge it