Locality: Profile Separator Recursion leaves length le card
ProvedQEC.Locality.ProfileSeparatorRecursion_leaves_length_le_cardlean-qecert-4a64933quantum-computingquantum-error-correction
The number of nonempty leaves is bounded by the root cardinality.
Preamble
import Definitions.Def_QEC_Locality_SeparatorProfile_EdgeDivision
import Definitions.Def_QEC_Locality_SeparatorProfile_Recursion
set_option autoImplicit false
open QEC QEC.Locality
universe u
variable {ι : Type u} [Fintype ι] [DecidableEq ι]Formal statement
theorem QEC.Locality.ProfileSeparatorRecursion_leaves_length_le_card
{G : ConnectivityGraph ι} {r : Nat} {vertices : Finset ι}
(tree : ProfileSeparatorRecursion G r vertices) :
tree.leaves.length ≤ tree.root.card := by sorrySource