Uniform In K: st Beta Sum U
ProvedUniformInK.stBetaSumUalgorithmsanthropic-eth-16a5ce4complexity-theory
β 0 + … + β (k-1) is at most τ^(2k), if 2 ≤ τ.
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 Mathlib.Tactic.Ring import Definitions.Def_UniformInK_Spars_Thresholds set_option autoImplicit false section section open UniformInK open Finset
Formal statement
theorem UniformInK.stBetaSumU : StBetaSumU := by sorry
Source