Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The key technical mechanism (MRVZ reduction).

Proved
GeomFrac.geomFrac_gt_four_of_indep_ratio

by raver1975 · Sep 11, 2026 · Mathlib c5ea003 (Lean v4.30.0)

aether-cataloggeometry

The key technical mechanism (MRVZ reduction). A finite graph whose independence ratio is below 1/4 — equivalently 4 · α(G) < |V| — has geometric fractional chromatic number strictly greater than 4.

Applied to a unit-distance graph, this is precisely the statement that a finite unit-distance graph with independence ratio < 1/4 certifies that the fractional chromatic number of the plane exceeds 4.

theorem GeomFrac.geomFrac_gt_four_of_indep_ratio(G : SimpleGraph V)
    (h : 4 * G.indepNum < Fintype.card V) : 4 < geomFrac G := by sorry

Formalization Note Transplanted verbatim from the Aether Catalog source Geometry/GeomFractionalChromatic.lean; the statement is byte-identical to the source declaration, elaborated with autoImplicit disabled in the platform environment.

Preamble
-- Thm stub generated from Geometry/GeomFractionalChromatic.lean
import Mathlib
import Definitions.Def_Geometry_GeomFractionalChromatic
/-
Copyright (c) 2026. All rights reserved.

# Geometric Fractional Chromatic Number: the independence-ratio engine

This file develops, from first principles, the linear-programming lower bound that
drives the Matolcsi–Ruzsa–Varga–Zsámboki (`MRVZ`) programme on the fractional
chromatic number of the plane, following the strategy of de Grey (`deGrey`) and the
classical Erdős framing (`Er87`).

The *geometric fractional chromatic number* of a finite graph `G` is the value of the
covering linear program: assign nonnegative weights to the independent sets so that
every vertex is covered with total weight at least `1`, and minimise the total weight.
We model a feasible point as a `FracColoring` and define `geomFrac G` as the infimum of
the achievable totals.

## Main results

* `FracColoring.card_le_indepNum_mul_total` — the LP-duality core:
  `|V| ≤ α(G) · total(c)` for every feasible fractional coloring `c`,
  where `α(G) = G.indepNum` is the independence number.  This is a genuine
  double-counting / weak-duality argument.
* `geomFrac_ge_ratio` — consequently `|V| / α(G) ≤ geomFrac G`.
* `geomFrac_gt_four_of_indep_ratio` — **the key technical mechanism**: if the
  independence ratio is below `1/4` (i.e. `4 · α(G) < |V|`), then
  `geomFrac G > 4`.  This is exactly the reduction used by `MRVZ`: a finite
  unit-distance graph with independence ratio `< 1/4` has fractional chromatic
  number strictly above `4`, hence so does the plane.
* `geomFrac_le_card` — the trivial singleton coloring gives `geomFrac G ≤ |V|`.

The geometric (unit-distance) instantiation lives in `UnitDistanceFractional.lean`.
-/

open SimpleGraph Finset
open scoped BigOperators

open GeomFrac

variable {V : Type*} [Fintype V] [DecidableEq V]


open FracColoring

variable {G : SimpleGraph V}
Formal statement
theorem GeomFrac.geomFrac_gt_four_of_indep_ratio(G : SimpleGraph V)
    (h : 4 * G.indepNum < Fintype.card V) : 4 < geomFrac G := by sorry
Source
https://github.com/paulklemstine/Lean/blob/53c2925a02/Catalog/Geometry/GeomFractionalChromatic.lean#L172

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