Fld: s D lt
ProvedVariableBound.Fld.sD_ltalgorithmsanthropic-eth-16a5ce4complexity-theory
2^s < 32m, for m ≥ 1.
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_VariableBound_Field_Defs import Mathlib.Data.List.ProdSigma import Mathlib.Data.List.Nodup import Mathlib.Data.Finset.Image import Mathlib.Data.Fintype.Card import Mathlib.Data.Nat.Log import Definitions.Def_VariableBound_Field_Transfer set_option autoImplicit false section section open VariableBound VariableBound.Fld open Groundwork Finset
Formal statement
theorem VariableBound.Fld.sD_lt {m : ℕ} (hm : 1 ≤ m) : 2 ^ sD m < 32 * m := by sorrySource