theorem proved term proof

`phi_bit_more_efficient`

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

formal statement (Lean)

  61theorem phi_bit_more_efficient :
  62    Real.log phi < Real.log 2 := by

proof body

Term-mode proof.

  63  apply Real.log_lt_log (by linarith [phi_gt_one]) phi_lt_two
  64
  65/-- The meaning capacity of one recognition event (one 8-tick cycle)
  66    is exactly 12 real DOF (the dimension of CP6). -/

depends on (20)

Lean names referenced from this declaration's body.

of in IndisputableMonolith.Astrophysics.NucleosynthesisTiers decl_use
phi_lt_two in IndisputableMonolith.Constants decl_use
tick in IndisputableMonolith.Constants decl_use
tick in IndisputableMonolith.Constants.RSNativeUnits decl_use
phi_lt_two in IndisputableMonolith.Derivations.MassToLight decl_use
of in IndisputableMonolith.Foundation.DAlembert.LedgerFactorization decl_use
one in IndisputableMonolith.Foundation.IntegersFromLogic decl_use
is in IndisputableMonolith.Foundation.OptionAEmpiricalProgram decl_use
phi_lt_two in IndisputableMonolith.Foundation.PhiForcing decl_use
of in IndisputableMonolith.Foundation.PhiForcingDerived decl_use
one in IndisputableMonolith.Foundation.RationalsFromLogic decl_use
is in IndisputableMonolith.Foundation.SimplicialLedger.EdgeLengthFromPsi decl_use
of in IndisputableMonolith.Foundation.SpectralEmergence decl_use
is in IndisputableMonolith.GameTheory.MechanismDesignFromSigma decl_use
of in IndisputableMonolith.Information.PhysicsComplexityStructure decl_use
phi_lt_two in IndisputableMonolith.Information.RecognitionEntropy decl_use
phi_lt_two in IndisputableMonolith.Mathematics.Euler decl_use
is in IndisputableMonolith.Mathematics.RamanujanBridge.MockThetaPhantom decl_use
one in IndisputableMonolith.QFT.SpinStatistics decl_use
one in IndisputableMonolith.RecogSpec.Core decl_use