Universal Multiplicative FDR Bound for Benjamini-Hochberg
resolvedconfidence 70%
VibeMathed reports this item as resolved. VibeMath preserves that report as a source assertion and has not independently authored a plain-language mathematical explanation.
Precise statement
The Benjamini-Hochberg procedure is known not to control the false discovery rate at its nominal level under arbitrary dependence. A folklore conjecture in the FDR literature held that it must at least control the FDR up to a universal multiplicative constant. It does not: there are finite Gaussian models whose FDR divided by $q$ diverges as $q \downarrow 0$, with an explicit two-sided lower bound $q\sqrt{\log(1/q)}/(2\sqrt{\pi}) + 0.6493 q + o(q)$.
The source statement is reproduced for indexing with attribution. Mathematical correctness requires domain-expert or mechanical review. VibeMath has not independently audited statement
fidelity, correctness, priority, or novelty.
What AI did
GPT-5.6 Sol
The disclosure says only that the author used the model for assistance with proof exploration, exposition and editing. It does not attribute any specific step, so the lowest tier applies.
arXiv:2607.14812 - How Much Can Gaussian Dependence Inflate the Benjamini-Hochberg Procedure's FDR?
VibeMathed reports this item as resolved. VibeMath preserves that report as a source assertion and has not independently authored a plain-language mathematical explanation.
Known method families
construction (source-reported)
Source-reported tools: construction.
Independent: unknown · difference confidence: 0
What remains uncertain
VibeMath has not independently audited the mathematical statement, proof, or novelty claim.
VibeMath has not independently verified the mathematical claim.
AI-attempt independence and training-data exposure are unknown unless explicitly documented.
VibeMath has not independently audited the mathematical statement, proof, or novelty claim.