Rigidity: marginal invisibility is exactly row balance.
ProvedLogic.JFeature.rowBalanced_of_enrich_singletonsaether-cataloglogic
Rigidity: marginal invisibility is exactly row balance. If every
single-row cell has enrichment ratio 1 — the weakest possible instance of a
flat marginal sweep — then the hit set is row balanced, and conversely by
enrich_rowSet_eq_one. So the flat outcome of a marginal sweep is precisely
equivalent to row balance of the hit set, and says nothing else.
theorem Logic.JFeature.rowBalanced_of_enrich_singletons[Nonempty β] {H : Finset (α × β)}
(hcard : 2 ≤ Fintype.card α)
(h : ∀ a : α, enrich H (rowSet ({a} : Finset α)) = 1) :
∃ m : ℕ, RowBalanced H m ∧ H.card = Fintype.card α * m := by sorry
Formalization Note Transplanted verbatim from the Aether Catalog source Logic/JFeatureMarginalBlindness.lean; the statement is byte-identical to the source declaration, elaborated with autoImplicit disabled in the platform environment.
Preamble
-- Thm stub generated from Logic/JFeatureMarginalBlindness.lean
import Mathlib
import Definitions.Def_Logic_JFeatureMarginalBlindness
/-
# Marginal blindness: why no `j`-feature can carry a hidden pair-carrier
This file formalises the structural reason behind the empirical verdict
`H0_CARRIER_OPEN` of the j-feature sweep (paper 248): *eight* registered
families of arithmetic features of the position index `j`
(`j mod 4`, `j mod 3`, `j mod 5`, `j mod 7`, `j mod 105`, `omega_small(j)`
terciles, smoothness of `|j - nearest square|`, `10^6`-smoothness of `j`)
all returned honest enrichment ratios `R ≤ 1.11`.
The theorems below say that this is not an accident of the particular eight
features chosen: on a sample space `α × β` where the hit set is *row balanced*
(every value of the first coordinate carries the same number of hits), **every**
cell cut out by **any** function of the first coordinate has enrichment ratio
*exactly* `1`. Whatever new feature of `j` one invents, the marginal sweep is
guaranteed to return `R = 1`; the sweep has no power at all against carriers
that live in the *joint* (consecutive-position) structure.
Yet such carriers exist and are arbitrarily strong: for the graph of a
permutation `σ : α ≃ β` (a row-balanced hit set with one hit per row) the joint
cell "the graph itself" has hit rate `1`, i.e. enrichment `card α` over the
global rate, while all marginal cells sit at exactly `1`.
Main results.
* `exists_fiber_hits_ge` / `exists_fiber_rate_ge_globalRate` : the *selection
floor*. For every feature map and every hit set there is always a nonempty
cell whose hit rate is at least the global rate; a raw "max over cells of
`R`" statistic is therefore `≥ 1` by pure pigeonhole, with no signal
whatsoever. (Used in `Logic.JFeatureMaxStatistic` to show that the
uncalibrated max test has type-I error rate `1`.)
* `rate_rowSet`, `enrich_rowSet_eq_one`, `enrich_marginal_feature_eq_one` :
**marginal blindness**.
* `graphFinset_rowBalanced`, `rate_graphFinset`,
`graph_joint_rate_eq_card_mul_globalRate`,
`marginal_blind_carrier` : the joint carrier that is invisible to every
marginal feature, with unbounded joint enrichment.
-/
open Logic.JFeature
open Finset
/-! ## Hit rates, global rate, enrichment -/
variable {ι : Type*} [Fintype ι] [DecidableEq ι]
/-! ## The selection floor: some cell always looks enriched -/
variable {ι : Type*} [Fintype ι] [DecidableEq ι]
variable {κ : Type*} [Fintype κ] [DecidableEq κ]
/-! ## Marginal blindness on a product sample space -/
variable {α β : Type*} [Fintype α] [Fintype β] [DecidableEq α] [DecidableEq β]Formal statement
theorem Logic.JFeature.rowBalanced_of_enrich_singletons[Nonempty β] {H : Finset (α × β)}
(hcard : 2 ≤ Fintype.card α)
(h : ∀ a : α, enrich H (rowSet ({a} : Finset α)) = 1) :
∃ m : ℕ, RowBalanced H m ∧ H.card = Fintype.card α * m := by sorrySource