Notes
Auxiliary results, expanded proofs, and working ideas.
N0007 · version 0.1 · updated
Proof: Draft
Review: Not externally reviewed
Contribution: Follow-up deductions; not an omitted draft section
Hahn-BanachComputable analysisWeihrauch reducibilityRepresentationsNorm information
Norm recovery in the limit, a precise upper-bound bridge to the retained proofs, and a finite-dimensional obstruction.
N0006 · version 0.2 · updated
Proof: Draft
Review: Not externally reviewed
Contribution: Expanded known reduction; general transport and scope clarification
Hahn-BanachComputable analysisWeihrauch reducibility
Unknown-norm transport, the retained norm-one forcing construction, and the lower bound for the literal exact-norm problem.
N0005 · version 0.1 · updated
Proof: Draft
Review: Not externally reviewed
Contribution: Expanded isometry proof and explicit formulas
Hahn-BanachComputable analysisWeihrauch reducibilityIsometries
A branch-free block formula, explicit inverse and complete Cauchy-name conversion for the varying gadget space.
N0004 · version 0.2 · updated
Proof: Draft
Review: Not externally reviewed
Contribution: Expanded loop proof; exact-oracle follow-up marked
Hahn-BanachComputable analysisWeihrauch reducibilityInfinite loops
The original norm-one state decoder, a general-bound version, and iteration of the literal exact-norm one-step oracle.
N0003 · version 0.2 · updated
Proof: Draft
Review: Not externally reviewed
Hahn-BanachComputable analysisWeihrauch reducibilityLipschitz-free spaces
The retained tree/free-space reconstruction with fixed located hyperplane, exact norm-one witnesses, and lower reductions to the literal problem.
N0002 · version 0.2 · updated
Proof: Draft
Review: Not externally reviewed
Contribution: Expanded known proof; supplied-bound generalization
Hahn-BanachComputable analysisWeihrauch reducibility
The direct certificate proof, a functional realizer, and the precise supplied-bound and exact-norm specializations.
N0001 · version 0.2 · updated
Proof: Expository overview
Review: Not externally reviewed
Contribution: Exposition and provenance
Hahn-BanachComputable analysisWeihrauch reducibility
The paper's evaluator-only convention, its norm-one restrictions, and a reading map for the retained proofs and the norm-information follow-up.
No notes to display.
Dependency map
An arrow A → B means that B lists A as a prerequisite. Conceptual similarity is not a proof dependency.
The map requires JavaScript. The text lists remain available without it.