AFTD Auto-Formalizing Theoretical Domains

LinearCodeSupportsRate

def

A common rate r is achievable by deterministic causal linear network coding over a field F on net with sessions sess if there exists a code : CausalLinearNetworkCode V K F net sess such that r ≤ (code.L : ℝ) / (code.T : ℝ).

Statement

def LinearCodeSupportsRate {V : Type} [Fintype V] [DecidableEq V] {K : Type} [Fintype K] [DecidableEq K]
    (F : Type) [Field F] (net : CapacitatedNetwork V) (sess : UnicastSessions V K) (r : ℝ) : Prop
Defined in
arXiv:2610.10108, Sec. 2
Verified
20 Oct 2026
Axioms
none listed
Built on 3
  • CausalLinearNetworkCodeA structure CausalLinearNetworkCode parameterized by a finite vertex type V with decidable equality, a finite session type K with…
  • CapacitatedNetworkAn undirected capacitated network on a finite vertex set V given by a simple graph G where each edge in G has strictly positive capacity…
  • UnicastSessionsA collection of unicast communication sessions indexed by a type K on an arbitrary vertex type V, consisting of a source map src : K → V,…
Used by 7

Read back from the Lean

Given finite types with decidable equality V (network nodes) and K (session identifiers), a field F, a capacitated network net on V, a collection of unicast sessions sess between nodes in V indexed by K, and a real number r: LinearCodeSupportsRate F net sess r asserts that there exists a causal linear network code code (over field F, network net, and sessions sess) such that r ≤ (code.L : ℝ) / (code.T : ℝ).

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

/-- Common rate r is achievable by a deterministic causal linear network code over field F. -/
def LinearCodeSupportsRate {V : Type} [Fintype V] [DecidableEq V] {K : Type} [Fintype K] [DecidableEq K]
    (F : Type) [Field F] (net : CapacitatedNetwork V) (sess : UnicastSessions V K) (r : ℝ) : Prop := ∃ code : CausalLinearNetworkCode V K F net sess, r ≤ (code.L : ℝ) / (code.T : ℝ)
See it in the graphDiscuss this resultChallenge it