λEnter Calculus CompanionRegistered manuscripts, kept distinct
EnterAskBrowseOpenAIFormulasDevelopPlainEmergenceConnectionsProblemsSettings

Manuscript IX-E-3@1 · IX-E-3.tex · section · 8c41417a

A minimal conditional bridge

The geometric bridge and the missed-ball branch › A minimal conditional bridge · lines 961–966

Back to manuscript

The scalar-slot lower theorem is useful for full exclusion (eq:full-exclusion), but it is stronger than needed to annihilate the commutator.

Nearby in this section

  • theorem: Theorem: Bridge from the boundary-trace certificate alone
  • section: A minimal conditional bridge

A searchable companion, not a proof checker. A restatement is not a verification, and results from one manuscript are not results of another. The registered manuscripts were produced by Ngo Cheung. The OpenAI section is a separate catalogue by OpenAI and is not a theorem of that series. Cite one registered manuscript as Cheung, N., with its identifier, at enter.grok.me.