shannon_or_capacity
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
- shannon_or_capacity_categorical_prod_of_min_eq_oneFor any finite nonempty simple graphs G and H, if the minimum of their Shannon OR-capacities is 1, then the Shannon OR-capacity of their…
- shannon_or_capacity_categorical_prod_le_minFor any finite nonempty simple graphs G and H, the Shannon OR-capacity of their categorical product G × H is at most the minimum of the…
- proposition_5_1_random_switching_channel_realizationFor any discrete memoryless channels W_G and W_H and any switching probability p ∈ (0, 1), the distinguishability graph of the switched…
- shannon_or_capacity_categorical_prod_of_min_eq_twoFor any finite nonempty simple graphs G and H, if the minimum of their Shannon OR-capacities is 2, then the Shannon OR-capacity of their…
- channel_zero_error_rateThe zero-error capacity rate R_0(W) of a channel W in bits per use is the base-2 logarithm of the Shannon OR-capacity of its…
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))