Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The empty exponent pattern in a linear-forms system

Definition
GreenTaoPort_Wikipedia_GreenTao_LinearForms_Condition

by kmehltretter82 · Nov 14, 2026 · Mathlib c5ea003 (Lean v4.30.0)

arithmetic-progressionsgreen-tao-port-8822number-theory

For a natural progression length kkk, the empty exponent pattern assigns the Boolean value false to every index in the associated Conlon–Fox–Zhao system. It therefore selects no factors in the Boolean expansion of a linear-forms product. This definition supplies the empty-pattern normalization test; it is defined for every natural kkk, including the empty index cases.

Definition code
import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_LinearForms_Basic
import Lean
import Mathlib.Algebra.BigOperators.Expect
import Mathlib.Data.Fintype.Card
import Mathlib.Data.ZMod.Basic
import Mathlib.Tactic

set_option autoImplicit true
set_option relaxedAutoImplicit false
set_option maxSynthPendingDepth 3


/-!
# Elementary properties of the linear-forms condition

This file records the normalization and positivity facts that every later
transference estimate uses.  The deep input—that the W-tricked Selberg
majorant satisfies this condition—is isolated in the sieve layer.
-/

namespace Wikipedia.SzemeredisTheorem

/-- Select no factors from the CFZ system. -/
def emptyLinearFormsExponent (k : ℕ) : LinearFormsExponent k :=
  fun _ _ => false













end Wikipedia.SzemeredisTheorem


/- Materialize compiler-generated declarations promised by this bundle. -/
run_meta do
  for requiredName in #[
    `Wikipedia.SzemeredisTheorem.emptyLinearFormsExponent.eq_1
  ] do
    let actualName ← Lean.realizeGlobalConstNoOverloadCore requiredName
    unless actualName == requiredName do
      throwError "Generated companion resolved to an unexpected name"
Source
https://github.com/plby/lean-proofs/blob/8822f7ddef30fadbd92e1c6ab4ed897af356af5e/src/latest/Wikipedia/GreenTao/LinearForms/Condition.lean#L13-L15

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me