Fld: bit R xor
ProvedVariableBound.Fld.bitR_xoralgorithmsanthropic-eth-16a5ce4complexity-theory
In a ring with 2 = 0, the exclusive or of two bits is their sum.
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_Alg
import Mathlib.Tactic.Ring
import Mathlib.Tactic.LinearCombination
import Definitions.Def_VariableBound_Field_Ring
set_option autoImplicit false
section
section
open VariableBound VariableBound.Fld
variable {R : Type} [CommRing R]Formal statement
theorem VariableBound.Fld.bitR_xor (h2 : (2 : R) = 0) (a b : Bool) : bitR R (xor a b) = bitR R a + bitR R b := by sorry
Source