A contract for a truthful PreTeXt conversion atlas

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 document conversion maps one source representation into another. A conversion diagram records formats as nodes and conversion processes as directed edges. Lossless round trips require specified information to be recovered after converting there and back; a one-way conversion need not have that property.

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 registry marks reconstructed wording. The formats, version assumptions, and properties to preserve are not specified.

Catalogue screening limitation: PreTeXt software design, documentation, or publication feature request; no mathematical problem is specified by the supplied passage.

The source snapshot labels this record partially solved; this is catalogue metadata rather than independent verification of a mathematical result or the current completion of a project. 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.

Other conversions to/from PreTeXt. We should make a poster/diagram. [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

Catalogue and explain conversions to and from PreTeXt.

Sources

• S1 Ulam AI and the UnsolvedMath Contributors, UnsolvedMath: A Curated Collection of Open Mathematics Problems, record 20002159 (AIM-INFRASTRUCTURE-0059). 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-INFRASTRUCTURE-0059. https://github.com/PreTeXtBook/community/wiki/Moderated-Problem-Session.

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 20002159 and code AIM-INFRASTRUCTURE-0059 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 primary community-session entry was read. It is an implementation or documentation agenda, and its editorial catalogue title supplies no theorem specification. The following explicitly chosen model tests one route; no actual PreTeXt conversion, documentation release, or user study is claimed.

Research attempt: A conversion diagram whose paths overstate compatibility

Model each converter as a partial function with a declared input domain. A drawn arrow $A\to B$ says only that some converter exists; paths do not automatically establish conversion for every object of $A$. For example take $A=B=C=\mathbb Z$, let $f:A\to B$ be defined on nonnegative integers with $f(x)=x+1$, and let $g:B\to C$ be defined only on even integers with $g(y)=y/2$. Both arrows are valid, yet the path fails on input zero since $f(0)=1$ is outside $g$'s domain. Its exact domain is the odd nonnegative integers.

For arbitrary partial $f,g$, the composite domain is \[ \operatorname{dom}(g\circ f)=\{x\in\operatorname{dom}f:f(x)\in\operatorname{dom}g\}. \] This follows directly from the two operations needed to evaluate the composition. For a longer path, propagate an input through each stage and retain it only while the next domain predicate holds; induction proves that the retained input set is exactly the composite domain. If candidate input sets are finite and converter outputs and predicates are explicitly supplied, this is an executable finite test. A graph of format names alone omits the information needed for it.

Reversibility is another independent annotation. The total map $f:\mathbb Z\to\mathbb N$, $f(x)=|x|$, has the right inverse $g(n)=n$ on $\mathbb N$, since $f(g(n))=n$. But $g(f(-1))=1\ne-1$. A pair of arrows in both directions therefore does not prove source roundtrip. A truthful atlas must distinguish each direction's supported domain and loss behavior. The proof does not prescribe a visual design or inventory real converters.

Verification and adversarial audit

The finite examples and implications are checked directly in the argument. No production PreTeXt build or conformance test was run. The proof applies only to the declared model, with its input and identity assumptions.

Audit corrections.

Graph reachability is not equated with composable domains or invertibility. The concrete path fails on an explicit admissible first-stage input.

External computation.

None; symbolic arguments and boundary checks only.

Scope and remaining gaps

The result is an auxiliary route analysis, not completion of the original software or documentation agenda. Real versions, supported syntax, transformations, and usability requirements need concrete implementation and testing. No mathematical novelty or current feature-completion claim is made.

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://github.com/PreTeXtBook/community/wiki/Moderated-Problem-Session (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 and repository-format review; 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.