Algebraic certificates for nonparametric mixture likelihood

Research-attempt provenance

Definitions and mathematical statement

Shared notation.

Standard number systems are $\mathbb N,\mathbb Z,\mathbb Q,\mathbb R,\mathbb C$. Specialized notation and index ranges follow the cited source and the definitions below.

A nonparametric model allows an infinite-dimensional class of probability laws or functions rather than a fixed finite parameter vector. Applying algebraic techniques requires specifying finite algebraic coordinates or constraints that encode the relevant statistical question. Likelihood and approximation guarantees depend on that representation.

Record scope and qualifications.

The catalogue title is retained as metadata. Named certificates, contracts, bounds or frameworks in that title are not asserted as results of the original source extract. The phrases these techniques and nonparametric models have no unique referent in the excerpt. A mixture likelihood or polynomial certificate is not silently selected. The supplied catalogue marks this record partially solved; its present research status was not independently checked. Its supplied reconstruction is labelled unverified. The source text below is rendered literally where necessary; damaged formulas and composite extracts are not silently repaired into a new mathematical claim. The supplied catalogue marks this formulation as an unverified reconstruction; missing assumptions are not certified by the source link.

Statement recorded in the supplied source.

Question 46 (Steele). What might be the application of these techniques to nonparametric models? [S2]

Source status.

The supplied catalogue labels this source record partially solved; that metadata was checked against the supplied snapshot on 2026-10-11. The label is preserved for provenance and is not an independent verification of present open status or mathematical correctness.

Short English statement

The source asks whether previously discussed algebraic techniques extend to nonparametric models.

Sources

• S1 Ulam AI and the UnsolvedMath Contributors, UnsolvedMath: A Curated Collection of Open Mathematics Problems, record 20001222 (AIM-COMPUTATION-0060). Catalogue curation and metadata: CC BY 4.0. The source extract is retained; definitions, English summaries and qualifications are editorial additions. https://huggingface.co/datasets/ulamai/UnsolvedMath.
• S2 AIM Workshop Problem Lists, source linked by catalogue record AIM-COMPUTATION-0060. https://aimath.org/WWN/compalgstat/compalgstat.pdf.

Preparation and review.

The original source and UnsolvedMath contributors retain attribution for the source extract. Codex (GPT-6; exact serving revision not exposed) assisted with definitions, English summaries, scope notes and formatting. No new human mathematical authorship or independently verified solution is asserted. Permanent source ID 20001222 and code AIM-COMPUTATION-0060 checked against the complete supplied registry and current repository. Distinct upstream records, including repeated questions and broad or damaged extracts, are retained for complete coverage of the source CS category. A repeated record is not a new independent conjecture. Complete mathematical-equivalence and current-literature review has not been performed. Preparation and final review follow contribution prompts C and D, with source gaps disclosed. Structural and rendering checks do not establish a new theorem or open status.

Literature and context check

The original AIM Computational Algebraic Statistics workshop PDF was consulted. The preserved extract does not specify every model, parameterization or performance criterion needed by its broad question. The following declared model is an actual test of one route, not a replacement target or a claim of novelty for elementary statistical or algebraic facts.

Research attempt: Finite mixture support does not make the continuous search disappear

Choose a compact metric parameter space $\Theta$ and positive continuous kernels $k_i(\theta)>0$ for $N$ fixed observations. A Borel mixing probability measure $\mu$ produces $z_i=\int k_i(\theta)\,d\mu$, with log likelihood $\sum_i\log z_i$. Let $K=\{(k_1(\theta),\ldots,k_N(\theta)):\theta\in\Theta\}$. Every finite convex combination of more than $N+1$ points can be shortened: their augmented vectors $(v,1)$ are linearly dependent, so adjust weights along a nonzero dependence until one first becomes zero, preserving both their sum and the vector. Repeat. Therefore the convex hull is the image of compact $\Theta^{N+1}$ times a compact weight simplex, and is compact. Uniform continuity approximates any integral by finite sums over a finite partition of $\Theta$ (equivalently a finite cover with a measurable partition), so its vector lies in this closed convex hull. Conversely each convex combination is attained by an atomic measure.

The continuous positive likelihood attains its maximum on that compact set; positivity is bounded away from zero by compactness. At a maximizer $z_*$, its gradient is $g_i=1/z_{*,i}$. Differentiating toward every $v\in K$ gives $g\cdot v\le g\cdot z_*=N$. In an atomic representation of $z_*$, every positive-weight support point must have equality, since the weighted average equals $N$. All such points lie in one affine hyperplane of dimension at most $N-1$. The same linear-dependence shortening argument therefore leaves at most $N$ atoms. This is a complete elementary proof of finite support in this declared likelihood problem, not a claim about every nonparametric model.

The attempted computational shortcut restricts atoms to a fixed finite grid. Already for one observation $y=1/2$, Gaussian location kernel $k(\theta)=(2\pi)^{-1/2}e^{-(y-\theta)^2/2}$ and $\Theta=[0,1]$, the optimal atom is at $1/2$. A grid containing only zero and one gives likelihood smaller by the factor $e^{-1/8}$. Thus finite support is not finite known support. The global inequality $g\cdot k(\theta)\le N$ remains a continuous optimization certificate. It is algebraic only under additional kernel and domain assumptions that are not present in the source's nonparametric agenda.

Verification and adversarial audit

Weight elimination preserves nonnegativity by stopping at the first zero and handles affine dependencies without changing the likelihood vector. Compactness and strict kernel positivity were checked as explicit hypotheses. The one-observation grid example gives an exact objective loss.

Audit corrections.

Finite support was distinguished from a preselected finite grid, and strict positivity/compactness hypotheses were not imposed silently on the original agenda.

External computation.

None; symbolic arguments and boundary checks only.

Scope and remaining gaps

The original does not specify a nonparametric family. The first gap is solving or certifying the continuous support search in a chosen model with stated complexity; a finite-atom existence theorem alone does not supply it.

Integration review.

Codex (GPT-6; exact serving revision not exposed) reviewed the written arguments and expanded layout and source-reference wrappers. Repository metadata and the production web renderer were checked using Python 3.13 and JavaScript with MathJax 3.2.2. This model-assisted review is not independent human proof verification; no PDF compilation or formal proof checking is asserted.

Completion Estimate

COMPLETION: 0% The calculations below the preserved source statement investigate a concrete route, but establish no substantiated new progress toward the entire original target. Known special cases and failed sufficient conditions are not credited as a solution.

References

The original source references and catalogue attribution are preserved in the Sources section above. The following URLs were actually consulted for this attempt; retention of an additional original reference does not claim fresh consultation of it.

• https://aimath.org/WWN/compalgstat/compalgstat.pdf (consulted 2026-10-11).

Model and contributor disclosure

OpenAI gpt-6-astra, requested reasoning configuration ultra, generated this research attempt on 2026-10-11. The exact serving revision is not exposed. Codex GPT-6 performed orchestration, repository-format review, and a model-assisted mathematical audit of the written arguments; its exact serving revision is also not exposed. The mathematical route, boundary checks and final adversarial self-audit followed contribution prompts A then B in docs/contribution_prompts.md, after reading CONTRIBUTING.md. Python 3.14.2 assembled the standalone documents; any mathematical computation is specified in Verification. No theorem prover was used. No human mathematical authorship, substantial human proof correction, or independent human proof checking is asserted. Model-assisted review, source retrieval, and structural checks do not establish correctness or novelty. Full private reasoning transcripts are unavailable as reproducibility artifacts; the complete arguments, inputs and outcomes actually used are stated here or in the companion batch audit.

Final status

Unresolved as a new research contribution. This is a concrete route investigation, not a claim of new complete resolution or a current-status certification. A known answer reproduced for context does not become a new contribution. The catalogue's source-status label is preserved; this attempt status does not assert that a source-labelled solved question is open.