theorem proved term proof

`bandwidthBudget_succ`

No prose has been written for this declaration yet. The Lean source and graph data below render without it.

formal statement (Lean)

  59theorem bandwidthBudget_succ (t : ℕ) :
  60    bandwidthBudget (t + 1) = bandwidthBudget t + bitBandwidthPerCycle := by

proof body

Term-mode proof.

  61  unfold bandwidthBudget; ring
  62
  63/-! ## §2. NP-search workload -/
  64
  65/-- The minimum number of distinguishable comparisons required to
  66certify an NP-search witness of size `n` (i.e., search space `2^n`). -/

used by (1)

From the project-wide theorem graph. These declarations reference this one in their body.

pVsNPFromBITCert in IndisputableMonolith.Complexity.PvsNPFromBIT decl_use

depends on (8)

Lean names referenced from this declaration's body.

of in IndisputableMonolith.Astrophysics.NucleosynthesisTiers decl_use
bandwidthBudget in IndisputableMonolith.Complexity.PvsNPFromBIT decl_use
bitBandwidthPerCycle in IndisputableMonolith.Complexity.PvsNPFromBIT decl_use
of in IndisputableMonolith.Foundation.DAlembert.LedgerFactorization decl_use
required in IndisputableMonolith.Foundation.DomainBootstrap decl_use
of in IndisputableMonolith.Foundation.PhiForcingDerived decl_use
of in IndisputableMonolith.Foundation.SpectralEmergence decl_use
of in IndisputableMonolith.Information.PhysicsComplexityStructure decl_use