Complexity of the indiscrete face partition
ProvedWikipedia.SzemeredisTheorem.FacePartition.complexity_indiscreteadditive-combinatoricsgreen-tao-port-8822number-theory
Let be a nonempty finite set. The indiscrete face partition, consisting of the single atom , has complexity one:
Nonemptiness is essential to this statement about the number of partition atoms.
Preamble
/- Mechanically transplanted from https://github.com/plby/lean-proofs.git at 8822f7ddef30fadbd92e1c6ab4ed897af356af5e. Original scopes and proof bytes are oracle-derived. -/
import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Finite_Mean
import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_ConditionalAverage
import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_FacePartition
import Mathlib.Algebra.BigOperators.Expect
import Mathlib.Algebra.Order.BigOperators.Expect
import Mathlib.Data.Fintype.Card
import Mathlib.Order.Partition.Finpartition
import Mathlib.Tactic
set_option autoImplicit true
set_option relaxedAutoImplicit false
set_option maxSynthPendingDepth 3
/-!
# Finite face partitions
The finite regularity argument uses partitions of finite face spaces. This
file fixes the refinement convention, packages common refinements and
partitions generated by cuts, and constructs pullbacks along maps of finite
types.
Mathlib orders `Finpartition` by refinement: `P ≤ Q` means that `P` is finer
than `Q`. Consequently the lattice infimum is the common refinement.
-/
open Wikipedia.SzemeredisTheorem
open Wikipedia.SzemeredisTheorem.FacePartition
variable {Ω : Type*} [Fintype Ω] [DecidableEq Ω]
Formal statement
@[simp]
theorem Wikipedia.SzemeredisTheorem.FacePartition.complexity_indiscrete [Nonempty Ω] :
complexity (indiscrete : FacePartition Ω) = 1 := by sorry
Source