simple_graph_or_power
def
The 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 adjacent in at least one coordinate.
Statement
def simple_graph_or_power {V : Type*} (G : SimpleGraph V) (n : ℕ) : SimpleGraph (Fin n → V)
- Defined in
- arXiv:2610.41977 eq. (1.1)
- Verified
- 03 Nov 2026
- Axioms
- none listed
- Used by 6
- 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…
- channel_zero_error_code_sizeThe zero-error code size M_0(W, n) for a channel W in n channel uses is the clique number of the n-th OR-power of its distinguishability…
- 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_capacityThe 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…
- 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…
Read back from the Lean
Given a type V, a simple graph G with vertices in V, and a natural number n, simple_graph_or_power G n is the simple graph on the vertex type Fin n → V where two vertices (functions) x, y : Fin n → V are adjacent if and only if there exists some index i : Fin n such that x i and y i are adjacent in G.
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 n-th OR-power (co-normal power) of a simple graph. -/ def simple_graph_or_power {V : Type*} (G : SimpleGraph V) (n : ℕ) : SimpleGraph (Fin n → V) := { Adj := fun x y => ∃ i : Fin n, G.Adj (x i) (y i) symm.symm := fun x y => by simp [SimpleGraph.adj_comm] }