Corpus formal_theorem canonical 2026-05-27T20:53:50+00:00
Corpus v3 · Formal theorem cid006104FTH0839canonicalv1

tau_complexity_bridge_concrete (theorem)

/-- [I.P32] The τ-complexity bridge: the spectral encoding translates Boolean satisfiability into a problem about τ-framework values. Key structural fact: for concrete CNF formulas, we can verify satisfiability by searching over CRT residues. -/

Formalization

lean_axiom_freesorries: 0project axioms: 0
  • ModuleTauLib.BookIII.Spectrum.ThreeSAT
  • Declarationtau_complexity_bridge_concrete
  • Lean toolchainleanprover/lean4:v4.x.x

Identifiers

  • Corpus ID cid006104
  • Primary alias FTH0839
  • Type Formal theorem
  • Status canonical
  • Visibility public
  • Version v1

Aliases & legacy IDs

tau_complexity_bridge_concretetau-complexity-bridge-concreteTauLib.BookIII.Spectrum.ThreeSAT::tau_complexity_bridge_concrete

Release lines

corpus_v2corpus_v3_working

Version & History

  • v1 · 2026-05-10 imported from v2 taulib declarations

Status disclaimer

A Corpus Item page reports the program's current internal record for this item. It does not imply external verification, scientific consensus, or final proof unless explicitly stated. Read it together with its dependencies, formalization status, and the program's overall stance.

Save or share this page for inspection

Download a portable dossier, copy a reviewer note, or send this page to someone who can inspect it.

Email to expert