Lex: val lt
ProvedGeneralPieces.Lex.val_ltalgorithmsanthropic-eth-16a5ce4complexity-theory
A string of λ bits, read as an integer, is below 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_GeneralPieces_Ring_Basic import Definitions.Def_GeneralPieces_Ring_Bridge import Mathlib.Combinatorics.Colex import Mathlib.Data.List.Lex import Definitions.Def_GeneralPieces_Ring_Lex set_option autoImplicit false section section open GeneralPieces GeneralPieces.Lex open AppHalfPieces Finset
Formal statement
theorem GeneralPieces.Lex.val_lt {lam : ℕ} (x : Pieces.Bits lam) : val x < 2 ^ lam := by sorrySource