Skip to content

APF Paper 1 — The Enforceability of Distinction (Technical Supplement)

Sep 2026 · Zenodo (CERN European Organization for Nuclear Research)
Quantum Mechanics and Applications

Abstract

Technical Supplement to Paper 1 of the Admissibility Physics Framework (APF), The Enforceability of Distinction. The minimal defender quotient is a generated Boolean algebra modulo a kernel ideal. The process-theoretic defender is a partial Boolean-record functor. The supplement gives the LP-versus-NPA distinction in sharp form, and the bridge to standard reconstruction frameworks (Spekkens-style noncontextuality, Fine joint distributions, NPA hierarchy) as finite-static equivalence propositions. Scope. This supplement establishes the minimal continuation/enforcement foundation and the exact Sep/IJC algebraic classification at a finite joint-query interface. It does not derive Hilbert space, complex amplitudes, the Born rule, tensor products, or the Standard Model. Those need additional record-positivity and composite-tomography assumptions, and they are taken up in the quantum-structure supplement. Primitive spine — three commitments only. (i) Physical identity is finite admissible continuation identity. (ii) A physical distinction is a finite enforceable separator of continuation profiles. (iii) Physical distinctions carry positive enforcement cost. Everything else is either a forced construction (the physical quotient, descent of distinctions and filters, the enforcement ledger, convex mixtures from classical control, the continuation-word quotient algebra), an APF normal form supplied by a finite interrogation protocol (finite query family Q, finite tested word set 𝒯, finite operational resolution, positive resolved floor), or a theorem-local trigger condition (no-added-resource coarse-graining for monotonicity, factorized support for additivity, ledger independence for counting, R1–R4 compactness for the robust-floor extension). Main theorem — Sep/IJC representation. A finite joint-query interface (Γ, Q, 𝒯) admits a commuting-extension defender if and only if its tested continuation-word algebra 𝒜Q,𝒯 embeds faithfully into ℝΛ as a commutative record representation. Equivalently, defender existence is recast as a finite Boolean-feasibility problem over unit, product, recovery, positivity, and state–effect equations. The Sep branch is the case where the queried interface fits inside one shared classical record. The IJC branch (Intrinsic Joint Constraint) is the precise failure of every faithful commuting continuation completion. IJC is not a synonym for "quantum" — it is an interface-relative algebraic verdict on whether a single Boolean-record completion exists for the tested word behavior. Surrounding results. Refinement stability. Sep is monotone under coarsening of 𝒯. IJC can be revealed by refinement but cannot be erased by it. Branch verdicts are stated relative to both 𝒯 and the chosen operational resolution. Directed finite-test limits. A coherent projective family of finite-stage defenders is required for a global Sep limit. Sep at each finite stage alone does not suffice. Compactness and bounded-atom hypotheses recover a projective-limit defender. ε-faithful defenders and finite-margin robustness. Approximate Sep with explicit operational-norm tolerances. The IJC margin m is preserved under perturbations of size below m/2. Continuation-word quotient algebra. Typed partial-product structure, incompatible-concatenation rule, contextual congruence, and the two-sided ideal property — proved before the quotient is used. No-added-resource criterion. Operational sufficient tests and a checklist precede the cost-monotonicity theorem. Passive post-processing is the canonical witness. Worked models. A fully worked Sep defender. CHSH defender failure rendered as a finite linear-program obstruction. A sequential IJC example. A coupled-but-classical example. A numerical ledger/floor case study and an explicit κΓ-calibration sensitivity table. Process-category axiom block. A finite APF process-category axiom block. The word algebra realized as a typed path algebra equivalent to a free word algebra modulo contextual-equivalence relations. The defender restated as a partial Boolean-record functor. Bridge to standard frameworks. Section 14 supplies a full finite GPT bridge (effect algebras, ordered *-algebras, accessible GPT fragments, cone equivalence) and finite-static equivalence propositions for Spekkens-style noncontextuality, Fine-style joint distributions, joint-measurability and commuting-dilation criteria, sheaf-theoretic contextuality, sequential instruments and order algebras, the resource-theoretic hierarchy, epBA minimal Boolean embeddings, and the NPA hierarchy with finite-level commuting certificates. Sep ⟺ commuting dilation ⟺ noncontextual model ⟺ existence of a faithful Fine joint distribution ⟺ existence of a global Bochner section in the static finite case. The Sep/IJC verdict is a single algebraic invariant that all of these frameworks witness from different sides. Why this matters for the series. Paper 1 is the bedrock of APF. v8.8 fixes that bedrock as a finite-interface algebraic theorem with an explicit primitive boundary (positive cost) and explicit theorem-local triggers, in language an external reviewer can audit without prior APF exposure. Downstream papers (Paper 2 on the Standard-Model gauge structure, Paper 5 on quantum reconstruction, Paper 6 on dynamics and gravity, Paper 8 on the Admissibility-Capacity Ledger) inherit the Sep/IJC dichotomy as the regime classifier. The deferred quantum-structure supplement adds the record-positivity and composite-tomography hypotheses that promote a faithful commutative record representation to a complex Hilbert-space construction. Code and reproducibility. Every theorem cited in the main paper traces to a named check function in the bundled apf/ package, including the inseparable-IJC bridge check check_T_inseparable_IJC. The companion repository contains the full codebase, manuscript .tex/.pdf, interactive D3.js dependency DAG, and a one-click Colab notebook that reproduces all Paper 1 results from first principles. GitHub repository Colab walkthrough notebook (one-click, no setup required) Interactive dependency DAG About the APF series. The Admissibility Physics Framework develops Standard Model and cosmological structure from a single primitive — finite enforcement capacity — through a chain of papers plus a machine-verifiable engine, with each result carried at its stated hypotheses. Each paper has a main text and, where applicable, a Technical Supplement, deposited on Zenodo and collected in the admissibility_physics community; the canonical engine (APF-Engine v24.3.504, 4,233 bank-registered theorems) records the constructions and controls behind every quantitative claim. The full series index is at admissibilityphysics.com. DOIs below are concept DOIs (they always resolve to the latest version). Paper 0 — What Physics Permits: A Constraint-First Framework for Physics — 10.5281/zenodo.18439523 Paper 1 — The Enforceability of Distinction — 10.5281/zenodo.18439200 · supplement Paper 2 — Finite Admissibility and the Failure of Global Description — 10.5281/zenodo.18439274 · supplement Paper 3 — Entropy, Time, and Accumulated Cost — 10.5281/zenodo.18439363 · supplement Paper 4 — Admissibility Constraints and Structural Saturation — 10.5281/zenodo.18439397 · supplement Paper 5 — Quantum Structure from Finite Enforceability — 10.5281/zenodo.18439433 · supplement Paper 6 — Dynamics and Geometry as Optimal Admissible Reallocation — 10.5281/zenodo.18439445 · supplement Paper 7 — A Minimal Quantum of Action from Finite Admissibility — 10.5281/zenodo.18439513 · supplement Paper 8 — The Admissibility-Capacity Ledger — 10.5281/zenodo.19721384 · supplement Paper 9 — The Geometric Substrate as Cost Structure of Comparison Continuations — 10.5281/zenodo.20041675 · supplement Paper 10 — The Calculus of Finite Continuability — 10.5281/zenodo.20041680 · supplement Paper 11 — Forced Universality from Capacity-Bounded Admissibility — 10.5281/zenodo.20684198 · supplement Paper 12 — The Gauge Sector of Admissibility Physics — 10.5281/zenodo.21212521 · supplement Paper 13 — The Minimal Admissibility Core — 10.5281/zenodo.18361446 Paper 14 — The Quantum Story — 10.5281/zenodo.21212188 · supplement Paper 16 — Markov Breakdown and the Hard Problems — 10.5281/zenodo.20684207 Paper 18 — The Electroweak Sector as a Capacity Equilibrium — 10.5281/zenodo.20684209 Paper 19 — Large-Angle CMB Suppression as a Finite-Continuability Constraint — 10.5281/zenodo.21199218 Paper 20 — The Enforcement Crystal — 10.5281/zenodo.18531732 · supplement Engine (Paper 21) — Admissibility Physics: An Executable Constraint Framework and Constants Map — 10.5281/zenodo.18529115 Paper 23 — Magnetically Dark Winding-Class Quantum Processors — 10.5281/zenodo.21199220 Paper 24 — The Recruitment-Radius Extension — Foundations — 10.5281/zenodo.20684211 · supplement Paper 25 — The Recruitment-Radius Extension: Applications — 10.5281/zenodo.21199222 · supplement Paper 28 — Absolute Mass Scales from Electroweak Capacity Saturation — 10.5281/zenodo.20684215 Paper 29 — Plaquette Representation Dominance and Confinement — 10.5281/zenodo.20684218 Paper 30 — A Tube Mechanism for the Lattice Mass Gap — 10.5281/zenodo.20684220 Paper 31 — Osterwalder–Schrader Structure of Lattice Yang–Mills — 10.5281/zenodo.20684222 Paper 32 — Quark Anchors as APF Trace Masses — 10.5281/zenodo.21199226 Paper 33 — Trace-to-Scheme Export Architecture — 10.5281/zenodo.20684224 · supplement Paper 35 — The Dark Sector as a Two-Role Capacity Decomposition — 10.5281/zenodo.20684228 · supplement Paper 36 — The Missing Floor — 10.5281/zenodo.21199228 Paper 37 — Collapse as Realignment — 10.5281/zenodo.21199231 · supplement Paper 38 — Unification as Ledger — 10.5281/zenodo.21199233 · supplement Paper 39 — Coherent Phase Regimes in the APF Interface Engine — 10.5281/zenodo.21199235 · supplement Paper 40 — The Thermodynamics of Finite Distinction (Between Symmetry and the Void) — 10.5281/zenodo.206842

View source

Similar papers

#computer vision Open access Jun 2016

Software Development in Startup Companies: The Greenfield Startup Model

The results are packaged in the Greenfield Startup Model (GSM), which explains the priority of startups to release the product as quickly as possible, and the need to shorten time-to-market, by speeding up the development through low-precision engineering activities.

Carmine Giardino, Nicolò Paternoster, M. Unterkalmsteiner et al. · 178 citations · ⚡14
#computer vision Open access Oct 2016

Software Startups - A Research Agenda

Software startup companies develop innovative, software-intensive products within limited timeframes and with few resources, searching for sustainable and scalable business models.

M. Unterkalmsteiner, P. Abrahamsson, Xiaofeng Wang et al. · 157 citations · ⚡17
#machine learning Review Open access Oct 2016

“Failures” to be celebrated: an analysis of major pivots of software startups

This study conducts a case survey study based on the secondary data of the major pivots happened in 49 software startups, and demonstrates that customer need pivot is the most common among all pivot types.

Sohaib Shahid Bajwa, Xiaofeng Wang, Anh Nguyen-Duc et al. · 127 citations · ⚡15
#computer vision Review Open access May 2015

A survey study on major technical barriers affecting the decision to adopt cloud services

The comparison of adopter and non-adopter sample reveals three potential adoption inhibitor, security, data privacy, and portability, which underlines the importance of the technical and security perspectives for research investigating the adoption of technology.

Nattakarn Phaphoom, Xiaofeng Wang, S. Samuel et al. · 111 citations · ⚡8
#computer vision Conference Open access Dec 2013

Affordable and Energy-Efficient Cloud Computing Clusters: The Bolzano Raspberry Pi Cloud Cluster Experiment

The ongoing work building a Raspberry Pi cluster consisting of 300 nodes is presented, with potential use cases being an inexpensive and green test bed for cloud computing research and a robust and mobile data center for operating in adverse environments.

P. Abrahamsson, S. Helmer, Nattakarn Phaphoom et al. · 110 citations · ⚡7
#computer vision Book Open access Mar 2017

On the Unhappiness of Software Developers

The results indicate that software developers are a slightly happy population, but the need for limiting the unhappiness of developers remains, and 219 factors representing causes of unhappiness while developing software are identified.

D. Graziotin, Fabian Fagerholm, Xiaofeng Wang et al. · 84 citations · ⚡6

Related blog posts

Microsoft Research Blog Oct 12, 2026

Simulating student learning for better AI tutoring

StudentSim is a research system for evaluating and improving AI tutoring tools before they are tested with learners. It models how individuals may engage with tutors, giving feedback to improve tutor performance across subjects like chess, writing, and mathematics. The post Simulating student learning for better AI tutoring appeared first on Microsoft Research.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.