Relative generalized bundle counting from an analytic step and envelope
ProvedWikipedia.SzemeredisTheorem.abs_bundleCount_pullback_sub_bundleMainProduct_le_envelopeadditive-combinatoricsgreen-tao-port-8822number-theory
Let the base-vertex type have decidable equality and the value type be finite and nonempty. Let real base weights on a finite base-edge family be idempotent and lie in , with empty-edge weight . Let the density function satisfy and for all . If the Tao bundle-counting step holds with bounds and is a valid envelope for , then every downward-closed bundle over a finite occurrence type with decidable equality satisfies . No decidable equality on is required.
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
/-! ## The analytic one-edge interface -/
universe uJ uG
variable {J : Type uJ} {G : Type uG}
[DecidableEq J] [Fintype G] [DecidableEq G]
{H : Finset (Finset J)}
/-! ## Full double induction -/
Formal statement
omit [DecidableEq G] in
theorem Wikipedia.SzemeredisTheorem.abs_bundleCount_pullback_sub_bundleMainProduct_le_envelope
[Nonempty G]
(A : HypergraphBundle.BaseEdgeWeight J G)
(p : Finset J → ℝ)
(α β μ : ℕ → ℝ) (τ : ℝ)
(E : ℕ → ℕ → ℝ)
(hA01 :
HypergraphBundle.BaseWeightsInUnitInterval H A)
(_hAidempotent :
HypergraphBundle.BaseWeightsIdempotent H A)
(hAempty :
∀ y :
{j : J // j ∈ (∅ : Finset J)} → G,
A ∅ y = 1)
(hpempty : p ∅ = 1)
(hpLower :
∀ e ∈ H, α e.card ≤ p e)
(hstep :
HasTaoBundleCountingStep
(H := H) A p β τ)
(hE :
IsBundleCountingEnvelope α β μ τ E)
{K : Type} [Fintype K] [DecidableEq K]
(B : HypergraphBundle J K H)
(hclosed : B.IsClosedUnderInclusion) :
|B.bundleCount (B.pullbackBaseEdgeWeight A) -
B.bundleMainProduct p| ≤
E B.order B.edges.card *
B.bundleMainProduct p := by sorry
Source