Uniform In K: st Node Bound U
ProvedUniformInK.stNodeBoundUalgorithmsanthropic-eth-16a5ce4complexity-theory
Bound.bound, in the form of the interface.
Preamble
/- Copyright (c) 2026 Anthropic, PBC. All rights reserved. Released under Apache 2.0; SPDX-License-Identifier: Apache-2.0. Source and original notices: https://github.com/anthropics/formal-math/blob/16a5ce41304fcdaea4e0be7c132e1c361dc26da5/eth/NOTICE -/ import Definitions.Def_UniformInK_Spars_Defs import Definitions.Def_StepMachines_Math_Sparsify import Definitions.Def_StepMachines_Math_Sparsify import Mathlib.Algebra.BigOperators.Ring.Finset import Mathlib.Tactic.Ring import Definitions.Def_UniformInK_Spars_Bound import Theorems.Thm_Groundwork_PolyT_all attribute [local fun_prop] Groundwork.PolyT.all set_option autoImplicit false section section open UniformInK open Finset Groundwork Groundwork.Sparsify WidthK
Formal statement
theorem UniformInK.stNodeBoundU : StNodeBoundU := by sorry
Source