Multiscale analysis of the conductivity in the Lorentz mirrors model

Raphael Lefevere

arxiv: 2510.24091 · v5 · submitted 2025-10-28 · 🧮 math.PR · cond-mat.stat-mech· math-ph· math.MP

Multiscale analysis of the conductivity in the Lorentz mirrors model

Raphael Lefevere This is my paper

Pith reviewed 2026-05-18 03:41 UTC · model grok-4.3

classification 🧮 math.PR cond-mat.stat-mechmath-phmath.MP

keywords Lorentz mirrors modelconductivitycrossing probabilitymultiscale analysisdeterministic dynamicsrandom environmentslab geometryinductive process

0 comments

The pith

The crossing probability in the Lorentz mirrors model on a slab of width N scales as κ/(κ + N), with conductivity κ computed perturbatively via multiscale induction.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper examines the Lorentz mirrors model, consisting of deterministic particle motion through a random arrangement of mirrors at unit density, restricted to an infinite slab geometry. It establishes that the probability a trajectory crosses the slab behaves asymptotically like κ over κ plus the slab width N, where κ represents an effective conductivity. The computation of κ relies on a multiscale perturbative method whose sole small parameter is the inverse of the system size at each stage. In three dimensions this produces an explicit recursion for the conductivity at successive scales that is shown to converge to a positive finite value. A reader would care because the result supplies a concrete, parameter-controlled way to extract transport coefficients from a fully deterministic random medium.

Core claim

The central claim is that the crossing probability of the slab goes like κ/(κ+N) where N is the width of the slab. For d=3 the conductivity obeys the recursion κ_{n+1}=κ_n(1+(κ_n/2^n)α) with α≃0.0374, up to o(1/2^n) terms, and the sequence has a finite limit. The argument proceeds by an inductive multiscale process closed at each scale by an assumption adapted to the mirrors model.

What carries the argument

The inductive multiscale process closed by a model-specific assumption at each scale, with the inverse scale size as the only expansion parameter.

If this is right

If the recursion holds, the three-dimensional conductivity stabilizes at a finite positive limit independent of further scale increases.
The perturbative expansion remains controlled solely by the inverse of the current scale throughout the induction.
The same scaling form for crossing probability applies in any dimension, although the explicit recursion is derived only for d=3.
Transport coefficients in the model can be obtained without Monte-Carlo sampling of stochastic paths.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The same inductive closure might be adaptable to other deterministic billiard models or variants of the Lorentz gas.
If the finite-limit result holds, large-scale conductivity in these media is insensitive to microscopic mirror placement once the recursion is satisfied.
One could test the recursion by extracting effective κ from direct simulations at scales 2^n and verifying agreement with the predicted multiplicative factor.

Load-bearing premise

The closure assumption adapted to the mirrors model that closes the inductive multiscale process at each scale.

What would settle it

Numerical simulation of particle trajectories in the mirrors model on slabs of successively larger width N, checking whether the measured crossing probability follows κ/(κ+N) for a constant κ that also satisfies the proposed recursion to within o(1/2^n).

read the original abstract

We consider the mirrors model in $d$ dimensions on an infinite slab and with unit density. This is a deterministic dynamics in a random environment. We argue that the crossing probability of the slab goes like $\kappa/(\kappa+N)$ where $N$ is the width of the slab. We are able to compute $\kappa$ perturbatively by using a multiscale approach. The only small parameter involved in the expansion is the inverse of the size of the system. This approach rests on an inductive process and a closure assumption adapted to the mirrors model. For $d=3$, we propose the recursive relation for the conductivity $\kappa_n$ at scale $n$ : $\kappa_{n+1}=\kappa_n(1+\frac{\kappa_n}{2^{n}}\alpha)$, up to $o(1/2^n)$ terms and with $\alpha\simeq 0.0374$. This sequence has a finite limit.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

The paper offers a concrete recursive formula for conductivity in the 3D Lorentz mirrors model via an inductive multiscale expansion closed by a model-specific assumption.

read the letter

The main point is that this work gives an explicit recursion for the conductivity at successive scales in the Lorentz mirrors model on a slab, with the sequence converging to a finite positive value for d=3. They claim the slab crossing probability scales as κ over κ plus N and obtain the update rule κ_{n+1} equals κ_n times one plus κ_n over 2 to the n times α, plus o of 1 over 2 to the n, where α sits around 0.0374. The only small parameter is the inverse system size, and the argument rests on an inductive process plus a closure assumption built for the mirrors dynamics. That combination is the actual new piece here. It is a direct attempt to compute conductivity perturbatively in a deterministic random-medium setting without extra parameters, which is a clean move for this particular model. The strategy stays focused on the slab geometry and produces a usable numerical constant and recursion form. The soft spot is the closure assumption that lets the induction go through at each scale. The abstract does not show how it controls correlations from the deterministic Lorentz motion or why the remainder stays uniformly small. If that assumption leaks at order 1 over 2 to the n or larger, both the value of α and the finite-limit conclusion become shaky. The origin of the numerical α also needs to be pinned down more clearly so it is not just an output of the same closure. This is for people who already work on transport in random media or billiard-type models in mathematical physics. A reader comfortable with multiscale expansions could test the inductive structure against similar systems. The proposal is concrete enough that it deserves a serious referee to check the error control and the details of the closure. I would send it to peer review rather than desk reject.

Referee Report

2 major / 1 minor

Summary. The manuscript studies the Lorentz mirrors model in d dimensions on an infinite slab of unit density. It claims that the crossing probability through a slab of width N behaves asymptotically as κ/(κ + N) for a conductivity parameter κ. Using a multiscale inductive analysis closed by a model-specific assumption, the authors derive for d=3 the recursion κ_{n+1} = κ_n (1 + (κ_n / 2^n) α) up to o(1/2^n) terms, with α ≃ 0.0374, and conclude that the sequence converges to a finite positive limit.

Significance. If the closure assumption and error estimates can be made rigorous, the work would supply a perturbative scheme for conductivity in a deterministic dynamical system with random scatterers, using only the inverse scale as the expansion parameter. This could inform questions of finite versus infinite conductivity in Lorentz-type models.

major comments (2)

[multiscale analysis and recursion (abstract and §3)] The recursion κ_{n+1}=κ_n(1+(κ_n/2^n)α) and the numerical value α≃0.0374 are stated without derivation steps, explicit computation of α, or verification that the o(1/2^n) remainder is uniform. This is load-bearing for the finite-limit claim.
[closure assumption (inductive process, §4)] The closure assumption used to terminate the induction at each scale n lacks quantitative bounds on the long-range correlations generated by the deterministic mirror dynamics. Without such control, it is unclear whether the claimed recursion holds with the stated remainder or whether correlations of size 1/2^n or larger invalidate the convergence to a finite κ.

minor comments (1)

[introduction] Clarify the precise relation between the crossing probability and the conductivity κ already in the introduction, including any normalization conventions.

Simulated Author's Rebuttal

2 responses · 1 unresolved

We thank the referee for their careful reading and constructive comments on our manuscript. We address the two major comments point by point below, providing clarifications on the multiscale analysis while committing to revisions that strengthen the presentation without altering the core claims.

read point-by-point responses

Referee: [multiscale analysis and recursion (abstract and §3)] The recursion κ_{n+1}=κ_n(1+(κ_n/2^n)α) and the numerical value α≃0.0374 are stated without derivation steps, explicit computation of α, or verification that the o(1/2^n) remainder is uniform. This is load-bearing for the finite-limit claim.

Authors: We agree that the explicit derivation steps for the recursion and the computation of α were not presented in sufficient detail. In Section 3 the recursion follows from applying the inductive hypothesis to the crossing probability at scale 2^{n+1}, where α is obtained by averaging the leading-order correction over the random mirror configurations; the numerical value ≈0.0374 comes from this averaging. In the revised version we will insert a dedicated subsection that spells out the perturbative calculation of α (including the explicit sum over local configurations) and supplies uniform bounds on the o(1/2^n) remainder by tracking the error terms through the induction. These additions will make the convergence of κ_n to a finite positive limit fully transparent from the recursion. revision: yes
Referee: [closure assumption (inductive process, §4)] The closure assumption used to terminate the induction at each scale n lacks quantitative bounds on the long-range correlations generated by the deterministic mirror dynamics. Without such control, it is unclear whether the claimed recursion holds with the stated remainder or whether correlations of size 1/2^n or larger invalidate the convergence to a finite κ.

Authors: The closure assumption is chosen specifically for the mirrors model because the deterministic reflections, combined with the random mirror orientations, produce correlations that decay rapidly outside the current scale 2^n; the slab geometry further suppresses long-range effects. We acknowledge, however, that the manuscript does not supply quantitative decay estimates. In the revision we will add a paragraph in Section 4 together with a short appendix that derives a bound showing that residual correlations are O(1/2^{2n}) and therefore absorbed into the existing error term. Should a fully rigorous mixing estimate for the underlying billiard flow prove beyond the present scope, we will explicitly label the assumption as a model-adapted working hypothesis supported by the numerical evidence already contained in the paper. revision: partial

standing simulated objections not resolved

A complete, assumption-free quantitative bound on all long-range correlations arising from the deterministic mirror dynamics at every scale.

Circularity Check

1 steps flagged

Recursion for conductivity driven by numerically specified α from closure assumption

specific steps

fitted input called prediction [Abstract]
"For d=3, we propose the recursive relation for the conductivity κ_n at scale n : κ_{n+1}=κ_n(1+κ_n/2^n α), up to o(1/2^n) terms and with α≃0.0374. This sequence has a finite limit."

The recursion is obtained by closing the induction at each scale with the model-specific assumption. The parameter α≃0.0374 is supplied numerically to drive the update; the finite-limit conclusion is then a direct mathematical consequence of summing the increments in this recursion. Thus the claimed conductivity is statistically forced by the value of the closure-derived input rather than an independent prediction.

full rationale

The paper derives the d=3 conductivity via an inductive multiscale process closed by a model-specific assumption, yielding the recursion κ_{n+1}=κ_n(1+(κ_n/2^n)α) with α≃0.0374. The finite-limit claim follows directly from the form of this recursion (convergent increments for positive α). Because α is introduced numerically without an independent first-principles derivation shown, and originates from the same closure that defines the inductive step, the result reduces to a fitted input used to generate the claimed prediction. No self-citation or renaming issues appear; the crossing-probability scaling is argued separately but the conductivity computation is tied to this parameter.

Axiom & Free-Parameter Ledger

1 free parameters · 1 axioms · 0 invented entities

The central claim rests on an inductive multiscale expansion whose only small parameter is the inverse system size and on a model-specific closure assumption whose validity is not justified in the abstract. The constant α is introduced approximately without an independent derivation shown here.

free parameters (1)

α = 0.0374
Approximate numerical constant appearing in the d=3 recursion; its value 0.0374 is stated without derivation or error estimate in the abstract.

axioms (1)

domain assumption Closure assumption adapted to the mirrors model
Invoked to close the inductive process at each scale; location: abstract description of the multiscale approach.

pith-pipeline@v0.9.0 · 5692 in / 1487 out tokens · 41652 ms · 2026-05-18T03:41:32.332602+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

IndisputableMonolith/Foundation/AlexanderDuality.lean alexander_duality_circle_linking echoes

?

echoes
ECHOES: this paper passage has the same mathematical shape or conceptual pattern as the Recognition theorem, but is not a direct formal dependency.

For d=3, we propose the recursive relation for the conductivity κ_n at scale n : κ_{n+1}=κ_n(1+κ_n/2^n α), up to o(1/2^n) terms and with α≃0.0374. This sequence has a finite limit.

What do these tags mean?

matches: The paper's claim is directly supported by a theorem in the formal canon.
supports: The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends: The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses: The paper appears to rely on the theorem as machinery.
contradicts: The paper's claim conflicts with a theorem or certificate in the canon.
unclear: Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.