arXiv:2606.27488v1

Survivor-conditioned renewal laws and observable bounds for open intermittent maps

Jason Duvall

math.DS37E0537A2537D2537A3537A5060K05

Abstract

Recent numerical computations and stochastic modeling by Brevitt and Klages suggest that introducing a hole in a Pomeau--Manneville map can suppress survivor-conditioned Lyapunov stretching. We prove a deterministic renewal theorem which explains this phenomenon and its observable-level generalizations. For an open intermittent map induced on a base away from the neutral fixed point, we describe the asymptotic distribution of the number of completed survivor returns to the base, conditioned on survival up to time tt. The limiting law is expressed in terms of the killed induced transfer operator; for the conditionally invariant density of the killed induced system it is geometric. We then prove two reward results for additive observables. A reward domination theorem gives bounded survivor-conditioned Birkhoff sums, while a stronger final-tail asymptotic gives convergence to a finite limit. For generalized Pomeau--Manneville maps, bounded observables satisfying ψ(x)Cxγ\lvert ψ(x) \rvert \leq C x^γ near the neutral fixed point and a mild variation condition satisfy the domination hypotheses. When the neutral branch and final tails satisfy the corresponding regularity assumptions, asymptotically regular observables satisfy the convergence hypotheses. In particular, ψ=logfψ=\log\lvert f' \rvert gives bounded survivor-conditioned Lyapunov stretching for the generalized class; under these additional regularity assumptions, it converges. Under an additional entropy-domination assumption, we also derive a zero entropy-rate consequence for survivor return-length names and record the complementary linear growth of stretching when the hole contains a neighborhood of the neutral fixed point.

AI-generated audit

Audit summary

Audited against arXiv v1

Not a correctness certificate. A “Correct” result may include yellow typos or minor formal corrections that do not affect substantive soundness. It means this audit found no unresolved substantive error under the stated criteria; it does not replace expert scrutiny or formal verification.

Current report

Detailed mathematical audit

Generated August 18, 2026
01Statements2 reported findingsCorrect

The survivor-conditioned renewal law, boundedness and convergence criteria for additive rewards, and the generalized Pomeau–Manneville applications are correct under the explicitly stated killed-operator and tail-profile hypotheses.

Theorems 3.2, 4.3, 4.6, and 6.9Correct

The final long excursion determines the survivor law

Pages 7–14 and 19–22 · arXiv:2606.27488v1

The decomposition into completed survivor returns followed by one unfinished excursion gives Mr(t;v)at(Arv)M_r(t;v)\sim a_t\ell(A^rv) for every fixed rr. The defective renewal bound is summable uniformly in rr, permitting normalization by at((IA)1v)a_t\ell((I-A)^{-1}v) and yielding the limiting law; an eigenvector Ah=λhAh=\lambda h gives the geometric special case. Dominated reward operators give bounded conditional sums, and a matched final-tail asymptotic gives convergence. The intermittent-map estimates verify these hypotheses for observables of order xγx^\gamma, including logf\log|f'|.

Full paper, version 1
Theorems 4.3, 4.6, and 6.9Correct

Conditioned reward limits and intermittent applications follow the survivor renewal law

Sections 4 and 6 · arXiv:2606.27488v1

Truncation of long excursions makes conditioned Birkhoff sums tight, while the renewal decomposition identifies their limit after the stated normalization. The intermittent-map application verifies the operator tail and reward hypotheses with the announced regular-variation exponents.

02Proofs2 reported findingsCorrect

The defective renewal, tail-splitting, reward, and intermittent-map verification arguments are correct and complete.

Sections 2–7Correct and complete

Local return bounds and final-tail asymptotics are kept distinct

Pages 4–23 · Sections 2–7 · arXiv:2606.27488v1

For small completed time, fixed-shift regularity gives ats/at1a_{t-s}/a_t\to1; for the two large-time ranges, the s1κs^{-1-\kappa} local estimate and the defective renewal convolution are summable. The same split controls reward errors. In the application, bounded distortion and the neutral inverse-branch asymptotics supply exactly the operator and profile estimates assumed abstractly.

Sections 4–6Correct and complete

Reward truncation, tail control, and application-specific renewal estimates close

Pages 18–42 · arXiv:2606.27488v1

The proof splits excursions at a height tending to infinity slowly enough that the spectral main term remains uniform. Moment/tail estimates make the discarded rewards negligible, finite-height characteristic functions converge, and the intermittent examples supply the same bounds through their induced return operators.

03Novelty0 reported findingsNo non-novelty findings

No non-novelty findings.

Detailed audit reportFull reasoning, manuscript locations, and references.
Open report PDF ↗

Author response

Challenge an audit finding

Local workflow preview

A listed author may submit formal evidence that an audit is inaccurate. The response would be considered in a fresh AI re-evaluation; it would not edit the audit automatically.

Paper
arXiv:2606.27488v1
Authors listed
Jason Duvall
Audit date
August 18, 2026
  1. 01Establish identityMatch an authenticated scholarly identity to this paper.
  2. 02Submit evidenceIdentify the finding and give a formal mathematical response.
  3. 03Re-evaluateA separate agent checks the response and records a disposition.
Recommended production method

Authenticate with ORCID, then require an exact arXiv match

MathAudit should accept the identity only when ORCID OAuth authenticates the claimant's iD and this exact arXiv paper appears in arXiv's public authority feed for that iD. A matching name alone is not sufficient.

ORCID OAuth and arXiv authority-record lookup are not connected in this local prototype.

Email fallback for papers without a linked ORCID

A production fallback could send a one-time link only when the submitted address matches an independently maintained author-contact allowlist for this paper. MathAudit must return the same message for every address so the form cannot reveal which contacts are on that list.

This demonstration does not send, store, or compare the address.

Structured response preview

This form remains unavailable until production identity verification succeeds. Nothing entered here is submitted.

This panel never establishes authorship in the local prototype. A production result should be described narrowly as an authenticated ORCID match or control of a separately allowlisted author-contact mailbox.