2108.01271
ON N-TUPLEWISE IP-SENSITIVITY AND THICK SENSITIVITY
Jian Li, Yini Yang
correctmedium confidence
- Category
- math.DS
- Journal tier
- Specialist/Solid
- Processed
- Sep 28, 2025, 12:56 AM
- arXiv Links
- Abstract ↗PDF ↗
Audit review
The paper proves that in a non-trivial weakly mixing system, n-tuplewise thick sensitivity holds iff there are at least n minimal points (Theorem 4.4), using an equivalent proximal–minimal characterization (Proposition 4.3) to pass between thick sensitivity and separated minimal n-tuples. The candidate solution establishes the same equivalence: (⇒) it extracts a δ-separated minimal n-tuple from an ω-limit set; (⇐) it constructs, via a Baire argument in the product system, thick blocks witnessing separation. Apart from a minor technical slip (taking limits in an open separation set; easily fixed by using a closed separation set or shrinking δ), the model’s arguments align with the paper’s result. The two approaches differ in technique: the paper leverages proximality to a minimal point in X^n, while the model uses a Baire-category construction.
Referee report (LaTeX)
\textbf{Recommendation:} no revision
\textbf{Journal Tier:} specialist/solid
\textbf{Justification:}
The manuscript cleanly characterizes n-tuplewise thick sensitivity and situates it within the framework of weak mixing and minimality. The principal equivalence is elegant, with proofs that employ standard yet effective tools (product weak mixing, proximal–minimal structure). The results contribute meaningfully to the landscape of stronger sensitivity notions and their factor behavior.