A density floor bounds the selected and maximal-remainder product
ProvedWikipedia.SzemeredisTheorem.HypergraphBundle.pow_card_edges_le_selected_mul_maximalRemainderadditive-combinatoricsgreen-tao-port-8822number-theory
Let be a maximum-cardinality edge of a hypergraph bundle . Suppose and every base edge of cardinality has density at least . Then is at most the density of the projected selected edge times the maximal-remainder main product.
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 Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Hypergraph_HypergraphBundleRelativeCounting
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
/-!
# Relative generalized counting for closed hypergraph bundles
This file performs the double induction in Tao's generalized counting
lemma. Its sole analytic input is `HasTaoBundleCountingStep`: at one
maximal occurrence edge, the count differs from the main density times
the erased count by the square root of two lower-order counts plus the
common frozen-uniformity error.
The induction first decreases bundle order and then, at fixed order,
decreases the number of occurrence edges. The exact main-product
identities from `HypergraphBundleGeneralizedCounting` cancel every
lower-order density from the relative defect error. Consequently the
defect term pays only the selected-rank floor `α`, while the absolute
uniform term pays the all-rank floor `μ`.
-/
open Wikipedia.SzemeredisTheorem
open scoped BigOperators
open Wikipedia.SzemeredisTheorem.HypergraphBundle
variable {J K G : Type*}
[DecidableEq J] [DecidableEq K]
{H : Finset (Finset J)}
/-! ## Canonical pullbacks on subbundles -/
/-! ## Structural bounds for the two outer-induction bundles -/
/-! ## Elementary main-product and induction helpers -/
Formal statement
theorem Wikipedia.SzemeredisTheorem.HypergraphBundle.pow_card_edges_le_selected_mul_maximalRemainder
(B : HypergraphBundle J K H)
{g₀ : Finset K} (hg₀ : g₀ ∈ B.edges)
(hmax : ∀ g ∈ B.edges, g.card ≤ g₀.card)
(p : Finset J → ℝ) {a : ℝ}
(ha0 : 0 ≤ a) (ha1 : a ≤ 1)
(hp :
∀ e ∈ H, e.card = g₀.card →
a ≤ p e) :
a ^ B.edges.card ≤
p (g₀.image B.projection) *
B.maximalRemainderMainProduct g₀ p := by sorry
Source