Sizes: pow le
ProvedGeneralPieces.Sizes.pow_lealgorithmsanthropic-eth-16a5ce4complexity-theory
(32h²·2^{5h})^h ≤ 2^{12h²}, for h ≥ 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_GeneralPieces_Ring_Op import Definitions.Def_GeneralPieces_Ring_Lex import Definitions.Def_ClauseBound_Boson_Size import Definitions.Def_GeneralPieces_Ring_Sizes set_option autoImplicit false section section open GeneralPieces GeneralPieces.Sizes open AppHalfPieces MvPolynomial Finset GeneralPieces.Ring
Formal statement
theorem GeneralPieces.Sizes.pow_le {h : ℕ} (hh : 1 ≤ h) : (32 * h ^ 2 * 2 ^ (5 * h)) ^ h ≤ 2 ^ (12 * h ^ 2) := by sorrySource