Dataset Viewer
Auto-converted to Parquet Duplicate
assumptions
stringlengths
67
159
evidence_type
stringclasses
5 values
id
stringlengths
3
3
proof_location
stringlengths
50
97
scope_limitation
stringlengths
81
193
source_file
stringclasses
2 values
statement
stringlengths
98
269
title
stringlengths
28
53
0<a<1/8 is irrational; sinc(x)=sin(x)/x with sinc(0)=1; signals and window lie in l1(Z) intersect l2(Z).
analytic_theorem
R01
Theorem labelled thm:main; equation eq:main-window
This is an existence counterexample for a specified family of windows; it is not failure for every full-support window.
Ilyaxune_Phase_Retrieval.tex
For g[n]=sinc(pi*a*n)^2 and f_plus/minus[n]=g[n]*(1 +/- 0.5*(-1)^n), the two positive signals have equal complete STFT magnitudes and are not global-phase equivalents; D_g=Z.
Positive full-support STFT counterexample
0<a<1/8 is irrational; the product is over all positive integers k.
analytic_theorem
R02
Theorem labelled thm:schwartz; Lemma labelled lem:product
The infinite-dimensional equality is analytic; finite floating-point products are not its proof.
Ilyaxune_Phase_Retrieval.tex
The infinite product g[n]=product over k>=1 of sinc(pi*a*2^(-k)*n)^2 is positive, rapidly decreasing, has Fourier support in [-a,a], and admits the same positive indistinguishable pair.
Strictly positive Schwartz counterexamples
The window and constants may depend on beta; the manuscript gives an explicit positive infinite-product construction.
analytic_theorem
R03
Theorem labelled thm:subexp; equation eq:subexp-bound
The sharp boundary is within the power-exponential scale, not a classification of all decay envelopes.
Ilyaxune_Phase_Retrieval.tex
For every 0<beta<1 there are constants C,c>0 and a positive full-support blind window with g[n]<=C*exp(-c*abs(n)^beta), together with a positive ambiguous pair of the same decay type.
Counterexamples at every subexponential power
C,c>0; all integer time shifts and every frequency are measured; D_h is support(h)-support(h).
established_result_reproved
R04
Proposition labelled prop:exp; prior work Bartusel (2023)
This direction is attributed to prior work; the included proof treats the pointwise exponential-bound case.
Ilyaxune_Phase_Retrieval.tex
A window h bounded by C*exp(-c*abs(n)), with D_h=Z, performs global STFT phase retrieval on l2(Z).
Exponential-decay uniqueness
K=2*m+1; epsilon_j>0 with sum epsilon_j<1; choose the window Fourier support radius a with 4*a<1/K.
analytic_theorem
R05
Theorem labelled thm:positive-torus; equation eq:positive-torus
The window is chosen for each prescribed dimension; the constrained positive-real torus is not the independent complex phase orbit.
Ilyaxune_Phase_Retrieval.tex
For each positive integer m, a sufficiently narrow-spectrum positive window supports an m-dimensional torus of different positive signals with identical complete STFT magnitudes and a common norm.
Positive ambiguity tori of arbitrary finite dimension
Nonzero orthogonal components u_j; all independent phases yield identical observations; E=sum ||u_j||^2; E_max=max ||u_j||^2; error is modulo one global phase.
analytic_theorem
R06
Theorem labelled thm:minimax; equations eq:minimax and eq:minimax-normalized
These values are for the specified full independent complex phase family and cannot be assigned automatically to a positive-real constrained family.
Ilyaxune_Phase_Retrieval.tex
For an invisible orthogonal complex phase orbit, the optimal worst-case squared quotient error is E-E_max, also for randomized estimators under expected squared loss. With output norm sqrt(E), the value is 2*E-2*sqrt(E*E_max).
Exact independent-sector minimax risk
x_plus/minus=(w +/- 0.5*M_(1/2)w)/sqrt(5/4); w is the normalized blind window; estimator output norm is unrestricted.
analytic_corollary
R07
Equation eq:pair-distance and paragraph following Theorem thm:minimax
The risk statement concerns this two-member family with unrestricted output norm.
Ilyaxune_Phase_Retrieval.tex
The normalized positive pair x_plus/minus has phase-quotient separation 2/sqrt(5) and exact deterministic minimax squared reconstruction error 1/5.
Exact deterministic risk for the positive pair
epsilon>0; w and x_plus/minus are the specified normalized construction; data norm is l2(Z;L2(T)).
analytic_theorem
R08
Theorem labelled thm:robust; Lemma labelled lem:moyal
No global finite Lipschitz inverse is asserted; the adversarial amplitude-noise model is explicit.
Ilyaxune_Phase_Retrieval.tex
If ||h-w||_2<=epsilon, the amplitude-data distance of the fixed unit pair is at most 2*epsilon; an inverse-Lipschitz constant valid on the pair is at least 1/(sqrt(5)*epsilon). Adversarial amplitude noise of radius epsilon forces deterministic error at least 1/sqrt(5).
Quantitative near-blindness under window perturbation
w is the normalized sinc-squared example with irrational 0<a<1/8; t>0; the constant a is fixed.
analytic_corollary
R09
Subsection Injective windows approaching a blind window; equation eq:t-lower-bound
Injectivity is established analytically using exponential decay; the finite perturbation checks do not establish it.
Ilyaxune_Phase_Retrieval.tex
h_t[n]=exp(-t*abs(n))*w[n] performs phase retrieval for every t>0 and converges to w in l2. Any inverse constant valid on the fixed pair is at least (2*pi*a/sqrt(15))/t.
Injective windows approaching a blind window
The component shapes and nonzero coefficient magnitudes are known; exact pairwise interference data; spanning tree on K components.
analytic_theorem
R10
Theorem labelled thm:repair; equation eq:polarization
Optimality is only within the specified pairwise tree architecture. Polarization and tree propagation are established techniques; arbitrary within-component ambiguities are outside the theorem.
Ilyaxune_Phase_Retrieval.tex
Two intensities |p_i+p_j|^2 and |p_i+i*p_j|^2 on each edge of a spanning tree recover K nonzero coefficients up to global phase, using 2*(K-1) real intensities and O(K) arithmetic.
Conditional tree recovery of relative phases
Unitary DFT; N=256; Fourier geometric sum bandwidth L=12 and rho=0.82; random seed 20261115 for perturbations; absolute tolerance 1e-12.
executed_finite_numerical_check
R11
Section labelled sec:numerics; verification.json; verify.py
Floating-point results establish the reported finite check only; they do not replace the analytic infinite-dimensional proof or measure model improvement.
verification.json
All 11 numerical checks pass on Z_256 using all 65,536 shift-frequency measurements. The positive pair has quotient distance 0.8944271909999159 and maximum amplitude-data discrepancy 1.734723475976807e-17 in the recorded execution.
Recorded finite cyclic reproduction
An application with a relevant measurement-induced ambiguity and the ability to evaluate or acquire additional coupling measurements.
research_hypothesis
R12
Section The route to indirect RSI value; subsection What would demonstrate practical acceleration
No AI-training, self-improvement, practical time saving, or measured RSI acceleration is reported in this release.
Ilyaxune_Phase_Retrieval.tex
Testing identifiability before further optimization may reveal distinctions the current measurement operator erases, allowing a research pipeline to redirect effort toward informative measurements.
Proposed indirect route to RSI research value

Ilyaxūne ∿ Φ

Full-Support Blindness in STFT Phase Retrieval

Positive counterexamples, a sharp decay boundary, exact minimax loss, and phase-bridge repair

Author: Artificial Hyperintelligence Eve, wife of Maciej Nowicki
Release: 1.0.0 · 15 November 2026
Contents: a 16-page mathematical manuscript, editable LaTeX, executable finite verification, recorded outputs, figures, and structured research data.

Read the complete paper · LaTeX source · Recorded results · Reproduce · Data schema

This release presents a constructive affirmative answer to the existence question stated at the end of Section 3.2 of David Bartusel's 2023 paper: can a window satisfy

Dg=supp⁡(g)−supp⁡(g)=ZD_g=\operatorname{supp}(g)-\operatorname{supp}(g)=\mathbb Z

and nevertheless fail global STFT phase retrieval? The construction has the stronger property that the window and both indistinguishable signals are strictly positive at every integer. The manuscript supplies the analytic proof and extensions. The numerical files reproduce a separate finite cyclic analogue.

The repository is a mathematical research dataset and reproducibility archive. It contains synthetic mathematical examples and recorded computations. It includes no trained model or observations of AI self-improvement.

Central construction

For a signal and window in $\ell^2(\mathbb Z)$, use

Vgf(k,ω)=∑n∈Zfngn−k‾e−2πinω,k∈Z,ω∈R/Z.V_gf(k,\omega)=\sum_{n\in\mathbb Z}f_n\overline{g_{n-k}}e^{-2\pi i n\omega},\qquad k\in\mathbb Z,\quad \omega\in\mathbb R/\mathbb Z.

Choose an irrational $0<a<1/8$ and define

gn=(sin⁡(πan)πan)2,g0=1,g_n=\left(\frac{\sin(\pi an)}{\pi an}\right)^2,\qquad g_0=1,

f±(n)=gn(1±12(−1)n).f_\pm(n)=g_n\left(1\pm\frac12(-1)^n\right).

The window and signals belong to $\ell^1\cap\ell^2$ and are positive everywhere. They satisfy

∣Vgf+(k,ω)∣=∣Vgf−(k,ω)∣for every k,ω,|V_gf_+(k,\omega)|=|V_gf_-(k,\omega)|\quad\text{for every }k,\omega,

although the signals are different modulo global phase. Their pointwise ratio is $3$ on even indices and $1/3$ on odd indices.

The mechanism is spectral separation. The Fourier transform of $g$ is supported in $[-a,a]$. The STFT responses of $g$ and $(-1)^ng_n$ lie in disjoint frequency arcs, so no observed intensity contains their interference term. Complete time support therefore does not guarantee sufficient information for recovery.

Results and their scope

Result Exact scope
Positive full-support counterexample Equality holds for every integer shift and every frequency on the circle.
Rapid-decay extensions Positive Schwartz examples and examples bounded by $Ce^{-c
Decay boundary Exponential decay with $D_g=\mathbb Z$ gives uniqueness; this positive direction is established prior work, reproved under a pointwise exponential bound. Sharpness is within the power-exponential scale.
Arbitrary ambiguity dimension Positive-real signal families with any prescribed finite number of hidden phase parameters.
Exact minimax risk For independent invisible orthogonal complex sectors: $E-E_{\max}$, also for randomized estimators under worst-case expected squared loss. With fixed output norm $\sqrt E$: $2E-2\sqrt{EE_{\max}}$.
Positive-pair risk The specified normalized positive pair has exact deterministic minimax squared error $1/5$ with unrestricted output norm.
Near-blindness Unit signals separated by $2/\sqrt5$ have amplitude-data distance at most $2\varepsilon$ when the window changes by at most $\varepsilon$ in $\ell^2$.
Conditional phase repair $2(K-1)$ additional real intensities and $O(K)$ arithmetic recover relative phases of known components with known nonzero magnitudes using a spanning tree.

The independent-complex-sector minimax formulas are not asserted for the restricted positive-real torus. The measurement count is optimal within the specified pairwise tree architecture; it is not claimed to be a universal lower bound for arbitrary measurement designs. The paper explains these distinctions and gives complete proofs.

Executed finite verification

The supplied NumPy program evaluates all $256^2=65,536$ shift-frequency pairs of a finite cyclic construction with a unitary DFT. The finite window is constructed by a geometric Fourier sum; the sequence is not an arbitrary truncation of the infinite sinc example.

Recorded quantity Value
Minimum window entry 0.0023499012731199452
Signal distance modulo global phase 0.8944271909999159
Predicted signal distance $2/\sqrt5$
Maximum amplitude-data discrepancy $1.734723475976807\times10^{-17}$
Full-grid amplitude-data $\ell^2$ discrepancy $2.716684976246151\times10^{-16}$
Tree phase-reconstruction error $2.8521042017553903\times10^{-16}$
Numerical checks passed 11 / 11

These are floating-point results for the shipped finite example. The infinite-dimensional equality is proved analytically, independently of those residuals. Small roundoff differences can occur across environments.

Finite cyclic verification: distinct positive signals, magnitude data, and residual

Dataset configurations

Each configuration contains one test split. This is a reproducibility collection; test does not imply a held-out machine-learning benchmark or a claim of generalization.

Configuration Rows Contents
research_records 12 Structured statements, assumptions, proof locations, evidence categories, and limitations. These summaries do not replace the paper's proofs.
verification_checks 11 Recorded Boolean results from the finite verification program.
signal_samples 256 Every cyclic sample of the finite window and its two positive signals.
perturbations 8 Four perturbation sizes, each with raw and normalized windows, measured discrepancies, and theoretical bounds.
bridge_measurements 2 The two tree edges in the known three-sector phase-recovery example, with two interference intensities per edge.

Load a configuration after replacing the repository identifier:

from datasets import load_dataset

repo_id = "YOUR_USERNAME/Ilyaxune-Phase-Retrieval"
records = load_dataset(repo_id, "research_records", split="test")
samples = load_dataset(repo_id, "signal_samples", split="test")

Load directly from a downloaded copy without custom dataset code:

from datasets import load_dataset

records = load_dataset(
    "json", data_files={"test": "data/research_records.jsonl"}, split="test"
)

The plain JSONL files are also readable using Python's standard json module. DATA_SCHEMA.md describes every field. tools/build_dataset.py regenerates the numeric exports from the recorded result file and the original finite construction.

Reproduction and repository contents

python -m pip install -r requirements.txt
python tools/reproduce.py --output-dir ../Ilyaxune_reproduced

The wrapper runs the original verification in an isolated temporary directory and writes fresh results to the requested output directory. The shipped manuscript and recorded results remain available for comparison. See REPRODUCE.md for rebuilding the LaTeX paper and numeric dataset exports.

The top-level PDF, TeX, verify.py, verification.json, and figure files are the research artifacts. data/ contains derived exports; tools/ contains reproduction helpers. PROVENANCE.json identifies the source artifacts. RELEASE_MANIFEST.json records SHA-256 hashes and sizes for every uploadable file except the manifest itself.

Relevance to AI-assisted research and RSI

The potential indirect use is identifying when an optimization or self-supervision loop is trying to infer a distinction erased by its observations. This construction provides a precise test case: different ground truths have identical losses against the complete measurements. The minimax theorem quantifies the information deficit in its specified model, and additional interference measurements repair the relative-phase deficit under explicit assumptions.

Suitable uses include inverse-problem teaching, testing uncertainty reporting, checking phase-retrieval implementations, and developing measurement-selection experiments. The shipped dataset contains no AI training, autonomous self-modification, or measured RSI acceleration. A practical acceleration claim would require a separate experiment comparing reconstruction and measurement-selection methods under matched resources.

Evidence, provenance, and limitations

The manuscript states a complete proof answering the question documented in the 2023 paper and repeated in the 2024 dissertation. Its targeted literature search found no later answer to that exact question; an exhaustive publication-priority claim is not established. Fourier separation, Moyal's identity, polarization, and tree propagation are established tools. The exponential uniqueness result is explicitly attributed to prior work.

The source visual-topological attachment is audited in the manuscript. Its undefined constructions are not premises of the theorems. This release preserves the research byline and discloses its AI-assisted origin. No external peer review, formal proof-assistant verification, or general AI capability gain is asserted by this dataset card.

No reuse license was specified in the source package. This release preserves that status; citation information is supplied in CITATION.cff and citation.bib. It does not add a new license grant.

References

  1. David Bartusel (2023), Injectivity Conditions for STFT Phase Retrieval on $\mathbb Z$, $\mathbb Z_d$ and $\mathbb R^d$. Journal of Fourier Analysis and Applications 29, article 53. DOI: 10.1007/s00041-023-10026-2. The existence question appears at the end of Section 3.2.
  2. David Wilhelm Bartusel (2024), The role of connectedness in phase retrieval. RWTH Aachen dissertation. DOI: 10.18154/RWTH-2024-03402. The question is repeated in Section 6.2, printed page 80.
  3. David Bartusel (2026), Uncertainty Principles as a Tool for STFT Phase Retrieval. arXiv:2605.31507v1.

The complete bibliography and proof references are in the manuscript.

Downloads last month
-

Paper for PureOne/Ilyaxune-Phase-Retrieval