Deleting higher-order factors increases a duplicated product
ProvedWikipedia.SzemeredisTheorem.HypergraphBundle.duplicateOutside_bundleProduct_le_lowerOrderadditive-combinatoricsgreen-tao-port-8822number-theory
Let be a hypergraph bundle, let be a finite vertex set, and assume the base weights lie in . At every doubled assignment, the product of the bundle duplicated outside is at most the corresponding product of the lower-order bundle duplicated outside .
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_HypergraphBundleCounting
import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_HypergraphBundleDuplication
import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_HypergraphBundleFiltration
import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_HypergraphBundleGeneralizedCounting
import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_HypergraphBundleIndicatorDuplication
import Mathlib.Algebra.BigOperators.Expect
import Mathlib.Data.Fintype.Card
import Mathlib.Tactic
set_option autoImplicit true
set_option relaxedAutoImplicit false
set_option maxSynthPendingDepth 3
/-!
# Generalized counting for closed hypergraph bundles
This file packages the part of Tao's generalized counting argument which
is specific to hypergraph bundles.
There are two points which are easy to lose in a scalar recurrence.
* The defect at a selected maximal edge is localized to the product of
the strict-boundary indicators. Since those indicators already occur
among the remaining bundle factors, idempotence lets us insert that
boundary product without changing the contribution.
* After Cauchy--Schwarz, all remaining maximal-rank indicator factors may
be discarded. The resulting moment is the count of the duplicated
lower-order bundle. Its main-density product contains one copy of the
strict boundary and two copies of every other lower-order edge.
The last section records a flexible numerical envelope for the ensuing
double induction. It deliberately separates the same-rank density floor
`α` from the all-rank density floor `μ`: the defect term only loses powers
of `α`, while the common frozen-uniformity error may lose powers of `μ`.
-/
open Wikipedia.SzemeredisTheorem
open scoped BigOperators
open Wikipedia.SzemeredisTheorem.HypergraphBundle
variable {J K G : Type*}
[DecidableEq J] [DecidableEq K]
{H : Finset (Finset J)}
/-! ## Local strict-boundary products -/
/-! ## Main-product cancellation at a selected edge -/
/-! ## Discarding the other maximal-rank factors -/
Formal statement
theorem Wikipedia.SzemeredisTheorem.HypergraphBundle.duplicateOutside_bundleProduct_le_lowerOrder
(B : HypergraphBundle J K H) (g₀ : Finset K)
(A : BaseEdgeWeight J G)
(hA : BaseWeightsInUnitInterval H A)
(x : DoubledOccurrenceVertex g₀ → G) :
(B.duplicateOutside g₀).bundleProduct
((B.duplicateOutside g₀).pullbackBaseEdgeWeight A) x ≤
((B.lowerOrder g₀.card).duplicateOutside g₀).bundleProduct
(((B.lowerOrder g₀.card).duplicateOutside g₀).pullbackBaseEdgeWeight A) x := by sorry
Source