\documentclass[11pt,a4paper]{article} \usepackage[hmargin=27mm,vmargin=25mm]{geometry} \usepackage[T1]{fontenc} \usepackage{amsmath,amssymb,amsthm,mathtools,microtype} \usepackage{mathrsfs} \usepackage{array} \usepackage[dvipsnames]{xcolor} \usepackage[colorlinks=true,linkcolor=MidnightBlue,citecolor=MidnightBlue,urlcolor=MidnightBlue,breaklinks=true]{hyperref} \usepackage{bookmark} \hypersetup{pdftitle={Pointwise Correlations of Quadratic Form Values and Splitting Semigroups},pdfauthor={Roy van Rijn}} \newtheorem{theorem}{Theorem}[section] \newtheorem{proposition}[theorem]{Proposition} \newtheorem{lemma}[theorem]{Lemma} \newtheorem{corollary}[theorem]{Corollary} \theoremstyle{definition} \newtheorem{definition}[theorem]{Definition} \theoremstyle{remark} \newtheorem{remark}[theorem]{Remark} \newcommand{\Z}{\mathbb Z} \newcommand{\Q}{\mathbb Q} \newcommand{\C}{\mathbb C} \newcommand{\N}{\mathbb N} \newcommand{\E}{\mathbb E} \newcommand{\Prob}{\mathbb P} \newcommand{\1}{\mathbf 1} \DeclareMathOperator{\supp}{supp} \DeclareMathOperator{\lcm}{lcm} \DeclareMathOperator{\rad}{rad} \DeclareMathOperator{\Res}{Res} \DeclareMathOperator{\Cl}{Cl} \DeclareMathOperator{\Gal}{Gal} \DeclareMathOperator{\Frob}{Frob} \DeclareMathOperator{\TV}{TV} \newcommand{\ee}[1]{e^{2\pi i #1}} \allowdisplaybreaks[2] \setlength{\emergencystretch}{1.5em} \title{Pointwise Correlations of Quadratic Form Values\\ and Splitting Semigroups} \author{Roy van Rijn} \date{} \begin{document} \maketitle \begin{abstract} Under the stated analytic inputs, we establish the fixed-shift pair asymptotics predicted by Smilansky for the ordinary values of \(x^2+dy^2\), \(d=1,2,3,4,7\). In particular, the number of \(n\le X\) for which both \(n\) and \(n+1\) are sums of two squares is asymptotic to \(X/(2\log X)\). For primitive positive definite binary forms of fixed discriminants \(\Delta_i=f_i^2D\) sharing one negative fundamental discriminant \(D\), we count values admitting coprime coordinates. Replacing either form within its respective genus preserves the leading binary count, with a relative logarithmic saving through an independent classical route. Under the recent analytic inputs we give an explicit mixed leading term with relative \(o(1)\), including different fixed conductors in that one field, and no class-number divisor. The central mechanism is a shared comparison between sparse indicators and arithmetic models retaining every surviving congruence character. Following Walsh's proposed indicator extension, we supply the models, local factors and a uniform reflected-target argument, using the recent zero-free and weighted-dilation theorems of OpenAI. Applications to fixed subgroup restrictions and prime-coset self-sums give target-uniform asymptotics with logarithmic savings and exact eventual congruence criteria. They include prime support \(1\pmod{12}\) on targets \(2\pmod{12}\) and prime support \(3\pmod4\) on even targets. All counts concern numerical values without coordinate or ideal multiplicities. \end{abstract} \input{introduction} \setcounter{tocdepth}{1} \begingroup\small \makeatletter \renewcommand*\l@section{\@dottedtocline{1}{0em}{2em}} \makeatother \tableofcontents \endgroup \input{comparison} \input{inputs} \input{graph} \input{prime-estimates} \input{fixed-shift-comparison} \input{reflected-comparison} \input{assembly} \input{model-preparation} \input{quadratic-pairs} \section{Splitting semigroups and prime cosets}\label{sec:semigroup-apps} \input{theorems} \input{model} \input{cosets} \input{forms} \input{norms} \input{consequences} \appendix \input{older-norm-route} \paragraph{AI assistance and review.} ChatGPT (OpenAI) assisted with mathematical arguments, literature checks, exposition, proof review and verification code. \input{references} \end{document}