From Subconvexity to Doeblin Mixing on GL(2): The SAPZ Transduction Engine and a Converse-Theorem Interface (with Frey Applications)

## Overview

This record contains two tightly-coupled papers that isolate an *analytic engine* for converting
either (i) twist-side subconvexity input or (ii) prime-side effective Sato–Tate–type input
into **uniform mixing** (Doeblin minorization) for the SAPZ Markov kernel, and then connect
quantitative mixing/entropy contraction to a **GL(2) converse-theorem interface**.

- **Paper I (Engine):** *SAPZ Transduction Engine* — proves the transduction mechanism and
  the “cure ⇒ modularity” interface (via a CPS-style checklist).
- **Paper II (Application):** *Frey Application Note* — shows how to route the engine outputs
  into the Frey-curve layer as a conditional application.

The design goal is to make the remaining bottlenecks explicit and checkable: the engine is proved
inside Paper I, while the entry hypothesis needed to talk about the relevant Euler product remains
an openly-declared target (see “Targets A1–A2” below).

---

## What is proved vs. what is assumed (30-second classification)

### Proved in Paper I (Engine)

1. **Doeblin transduction (mixing from arithmetic input).**  
   Either input route yields a Doeblin minorization for the SAPZ kernel:
   - **SC-route (twist-side):** a subconvex transduction input (SC\_\vartheta)
   - **ST-route (prime-side):** an effective Sato–Tate–Lite input (ST2′), typically sourced
     from an effective Langlands–Linnik (LL) package

2. **Quantitative mixing ⇒ polynomial decay.**  
   From Doeblin minorization and functional inequalities, the HS/entropy diagnostics satisfy
   a polynomial decay
   \[
     \delta_E(T)=O(T^{-\alpha}), \qquad \alpha=\alpha(m_{\mathrm{ST}},c_0,c_1,c_2,\eta)>0,
   \]
   with an explicit dependence on the engine constants (recorded in a compact “interface” form).

3. **Cure ⇒ modularity (converse interface).**  
   A “spectral-entropy fever” detector is constructed so that **healing** (\(\delta_E(T)\to 0\))
   forces the GL(2) converse-theorem conditions through a checklist-style interface,
   yielding modularity of the underlying \(L\)-function *once the entry hypothesis is granted*.

### Assumed (explicit entry and interface slots)

- **(H1) Entry hypothesis:** the relevant Euler product \(L(s)\) exists as a meromorphic function
  with the baseline analytic structure required to even state the converse interface.
- **CPS checklist slots:** certain standard analytic requirements (e.g., strip bounds / functional
  equation input in the chosen formulation) are treated as named interface slots, either supplied
  externally or targeted for future closure.

---

## Conditional application: where FLT sits

Paper II uses the engine output (Doeblin + \(\alpha>0\)) to drive the Frey-curve diagnostics.
**FLT is presented as a conditional application**: if the entry hypothesis (H1) is supplied for
the Frey Euler product (e.g., by existing modularity results in the conservative route), then the
engine removes the additional mixing assumption (formerly denoted (H2′)) and the standard Frey/Ribet
pipeline yields the desired contradiction.

In other words:

- The **new contribution** is the analytic transduction/mixing engine and its converse interface.
- The **entry hypothesis (H1)** remains the dominant open bottleneck for an *independent* FLT closure.

---

## Targets A1–A2 (open closure problems, stated cleanly)

- **Target A1 (Entry independence):** prove (H1) for the Frey Euler product without invoking
  external modularity theorems.
- **Target A2 (Internalize the converse interface):** close the remaining CPS checklist slots
  from within the transduction/mixing framework (uniformity and strip-control type inputs).

These are stated so that progress can be tracked as concrete mathematical deliverables rather than
as narrative claims.

---

## Why this might be interesting (beyond the application)

- It proposes a **systematic analytic route** from arithmetic inputs (subconvexity / effective ST)
  to **mixing** for a spectral Markov kernel, with quantified decay exponents.
- It packages the GL(2) converse mechanism as a **checklist interface**, clarifying which parts are
  proved and which remain external assumptions.
- It separates the work into a reusable **engine paper** and a focused **application note**, making
  the architecture modular and easier to audit.

---

## Files in this record

- Paper I (Engine): `SAPZ_Transduction_Engine_v1.1a_engineonly_messagefix.pdf`
- Paper II (Application): `SAPZ_Frey_Application_v1.1a_conditionalnote_refsync.pdf`

(LaTeX sources are provided alongside the PDFs.)