Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lema condicional: ordinary Q positive from head tail — QnAudit

Proved
QnAudit.ordinary_Q_positive_from_head_tail

by bueno_ricardo · Nov 15, 2026 · Mathlib 0df444a (Lean v4.33.1)

analysis

Para n≥1,u>0, suponha Q(n,u)=oldQ(K,u,n) e integrabilidade do peso correspondente. Para t>0, suponha K(t)=H(t)+N(t)+E(t), H(t)>0, N(t)≥0 e |E(t)|≤r(t)H(t). Suponha r(t)<1 nos regimes t≤t₀ e t>t₀. Então Q(n,u)>0 para todo n≥1,u>0. Representação, integrabilidade e controle de cauda são hipóteses, não certificados de sua realização em ζ.

Escopo: resultado com as hipóteses indicadas. Não constitui uma prova de RH.

Preamble
import Mathlib
import Definitions.Def_RHPF28_QnAudit_e1481adb3874
import Theorems.Thm_QnAudit_heat_pos_from_two_regimes
import Theorems.Thm_QnAudit_ordinary_Q_positive_from_heat_representation
open MeasureTheory Set
open QnAudit
Formal statement
theorem QnAudit.ordinary_Q_positive_from_head_tail (Q : ℕ → ℝ → ℝ) (K H N E r : ℝ → ℝ) (t0 : ℝ)
    (hrep : ∀ n ≥ 1, ∀ u > 0, Q n u = oldQ K u n)
    (hint : ∀ n ≥ 1, ∀ u > 0,
      IntegrableOn (fun t => weight (u ^ 2) n t * K t) (Ioi 0))
    (hsplit : ∀ t > 0, K t = H t + N t + E t)
    (hH : ∀ t > 0, 0 < H t) (hN : ∀ t > 0, 0 ≤ N t)
    (hE : ∀ t > 0, |E t| ≤ r t * H t)
    (hsmall : ∀ t > 0, t ≤ t0 → r t < 1)
    (hlarge : ∀ t > 0, t0 < t → r t < 1) :
    ∀ n ≥ 1, ∀ u > 0, 0 < Q n u := by sorry
Source
Desenvolvimento RH — Ricardo Marangoni Brandao Bueno. PF28 FINAL 15/11/2026, §§69; 166.1; fonte avulsa AXLE_QN_POSITIVIDADE_AUDITORIA. Declaração QnAudit.ordinary_Q_positive_from_head_tail; arquivo lean/QnAudit.lean; SHA-256 7cad1bc7fece1a8e3fb2682e57bf8f37662b309735fe16160c8174a2e92a164c. Sem reivindicação de novidade. Fonte: AXLE_QN_POSITIVIDADE_AUDITORIA e inventário PF28 V1.

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