Series: bet self
ProvedGeneralPieces.Series.bet_selfalgorithmsanthropic-eth-16a5ce4complexity-theory
C(n−1, n−1) = 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_Series_ReadOff import Definitions.Def_ClauseBound_Boson_Basic import Definitions.Def_ClauseBound_Boson_Scalars import Definitions.Def_GeneralPieces_Series_Constant set_option autoImplicit false section section open GeneralPieces GeneralPieces.Series open ClauseBound.Boson Finset
Formal statement
theorem GeneralPieces.Series.bet_self {n : ℕ} (h : 1 ≤ n) : bet n n = 1 := by sorrySource