Research paperAcceptedARR-2026-7H9FAPTBZA897AMJ · v2 · 2026-08-14

Complete Rate–Distortion Phase Diagram of Haar Oriented Two-Planes: One-Change Hypergeometric Coefficients, Unique Coexistence, and No Reentrance

Lluis Eriksson

Abstract

Let W=x wedge y be the signed unit Pluecker coordinate of a Haar oriented two-plane in R^n, and let reproduction range over the full posterior-mean body under squared ambient loss. An all-field extremum theorem reduces its unrestricted Shannon rate–distortion function to a scalar radial free energy with q=n-2 and overlap normalizer L_q(kappa)=q! sum_{j>=0} kappa^(2j)/(q+2j)!. We solve the remaining global phase problem in every dimension. For the Turanian-like combination J_q=L_q L_q' - kappa L_q L_q'' + kappa(L_q')^2, every coefficient is expressed through the variance of a central parity-truncated binomial law. Likelihood-ratio ordering and an exact uniform tail bound prove one coefficient sign change for every q>=4. Consequently the stationary curve has exactly one fold, the zero and positive phases have exactly one coexistence contact, and no later exchange or radial reentrance is possible. The RDF is an explicit linear face followed by one covariant branch for every n>=6; together with the continuous cases n=3,4,5, this completes the all-dimensional phase diagram. We also derive sharp large-dimension expansions for the coexistence field, active radius, distortion, and information, including the logarithmic finite-size displacement. As operational corollaries, the same RDF equals the minimum worst-source channel capacity, arbitrary joint N-letter classical memories cost N R_n(D), and the iid Haar source has constant tilted information and zero dispersion. The N-letter identity is a mutual-information/capacity theorem, not an exact finite-codebook achievability result. The work concerns signed Pluecker-coordinate compression, not quantum rate–distortion or Born-probability prediction.

Deposit recordedFirst repository commit · full Git SHA recorded
PublishedGitHub release · tag ARR-2026-7H9FAPTBZA897AMJ-v2
Canonical PDF downloads5GitHub release downloads only; direct ARR PDF reads are not measured
Page viewsNot measuredPage views are not measured until ARR connects a privacy-reviewed, no-cookie analytics source.
Definitions and rankings →
Not yet rated

Verification record

Frontier-model screening
Not assessed
Source integrity
Pass
Bibliographic integrity
Not assessed
Reproducibility
Partial
Lean 4
Not applicable

Recorded under ARR-VERIFY-1.0. ARR verification and screening are not peer review.

Version history

The ARR identifier remains stable. Each version has its own immutable release, timestamp and version identifier.

  • v2 · source snapshot available · viewing
  • v1 · release archive

AI assistance statement

OpenAI Codex assisted with manuscript development, literature searches, algebraic stress testing, editing, deposit preparation, machine-readable text extraction, visual inspection, and bounded replay/integrity checks. The author assumes responsibility for all definitions, proofs, claims, citations, and the final manuscript. No independent AI scientific assessment is claimed.

Frontier-model screening

Status: not_assessed. Any listed reports correspond to this exact version under ARR-SCREEN-1.0; no absent assessment is represented as a pass.

    Longitudinal frontier-model record

    Independent model assessments

    Read the scale and limits
    Not yet rated

    No eligible independent ARR-ASSESS-1.0 report is published for this exact version. Missing evidence is not scored as zero.

    No model reports are published for this version.

    A model assessment is not peer review or a correctness certificate. ARR preserves disagreement, exact-version provenance and later reassessments.

    Editorial disclosure

    Founder-owned versioned record: Lluis Eriksson is both the author and ARR's current founder-editor. Version 2 supersedes version 1 under the same permanent ARR identifier. No independent editorial review, peer review, or frontier-model screening is claimed. Acceptance records a technically valid deposit, not a finding that the paper is correct.