Worked derivation: the structural integer 137

Inputs: two different retention operations

Let Q be a complex receiver of dimension ten, with a specified orthonormal basis of continuation labels. At depth d=1,2,3, let I_d be a d-dimensional complex innovation space. Select the branch receiver B_d=⊕_k=1^dΛ^kI_d. The degree-zero empty branch is excluded.

Define R₀=0 and R_d=(Q⊗R_d−1)⊕B_d. The direct sum keeps terminal branches distinct from continued records, and the tensor product retains every combination with a continuation label. These free-retention and stopping rules are inputs. In SMM/DTT they model how one source can preserve distinguishable generated histories; the three algebraic depths are not a replacement for the six nested inner roles.

Step 1: prove the branch ranks

Exterior multiplication imposes v∧v=0. Expanding the same identity for u+v gives u∧v=−v∧u. A basis of Λ^kI_d consists of products with k strictly increasing basis indices, so its dimension is binom(d,k).

For d=1 there is one singleton. For d=2 there are two singletons and one pair. For d=3 there are three singletons, three pairs and one triple. Thus b₁=1, b₂=3 and b₃=7. The binary count concerns whether an innovation appears in a basis monomial; amplitudes over those monomials remain complex. Including the empty branch would change the recurrence and therefore the final count.

Step 2: derive and expand the recurrence

Dimensions multiply under a tensor product and add under a direct sum. Hence r_d=10r_d−1+b_d. Starting with zero gives r₁=1, r₂=13 and r₃=137.

The sectors correspond to two continuations before termination, one continuation, and immediate termination. A formal variable t that counts continuation labels gives F₃(t)=100t²+30t+7. Evaluating at t=1 counts all records. It does not count physical duration unless each continuation has separately been assigned and justified as a temporal resource.

Step 3: prove that no legal words were counted twice

Tag continuation symbols as Q symbols and terminal symbols by their branch depth. A full record has exactly one of the forms q₁q₂b₁, q₁b₂, or b₃. Its first terminal symbol ends the word. Distinct symbol types and depth tags make the parsing unique.

Within each form, independent basis labels distinguish tensor products; the direct-sum tag distinguishes the three forms. Therefore the free construction really contains 137 independent records. If a realization introduces new relations of dimensions δ_d at successive stages, its rank instead obeys x_d=10x_d−1+b_d−δ_d. Expanding yields x₃=137−100δ₁−10δ₂−δ₃. Earlier information losses are amplified by later continuation factors.

Step 4: state the precise discrimination minimum

Suppose one error-free readout must identify every legal record from its encoded pure state ψ_i. Let E_i be the positive measurement effect reporting i, with effects summing to I. Perfect discrimination requires ⟨ψ_i,E_iψ_i⟩=1 and ⟨ψ_j,E_iψ_j⟩=0 for j≠i.

Positivity implies E_iψ_i=ψ_i and E_iψ_j=0. Thus ⟨ψ_i,ψ_j⟩=⟨ψ_i,E_iψ_j⟩=0. The receiver needs 137 orthogonal states, and the free basis attains this bound. This proves minimum dimension for the declared one-shot task; allowing errors, restricted questions or additional sequential resources changes the task.

Step 5: normalize two different sampling laws

A uniform final-record sampler gives each word probability 1/137. It can be implemented recursively by choosing each immediate terminal symbol with probability 1/r_d and each continuation symbol with probability r_d−1/r_d, then sampling the previous-depth record uniformly. The probabilities sum to [b_d+10r_d−1]/r_d=1, and every final word has the required equal probability.

A different sampler chooses uniformly among the available local terminal and continuation symbols. At depth three there are 17 choices; at depth two there are 13. It gives each immediate terminal word probability 1/17 and each longer word 1/221. Normalization is 7/17+130/221=1. The same 137-dimensional receiver thus supports unequal final probabilities.

Under uniform final sampling, the average continuation count is F′₃(1)/F₃(1)=230/137. That is a grammar statistic, not a derived electron delay or clock law.

Step 6: distinguish dimension from determinant degree

Give each original envelope vector and innovation phase weight one. Then Q has weight two, while an exterior k-product has weight k. The branch weight polynomials are z, 2z+z² and 3z+3z²+z³. Propagating them through the same recurrence yields:

The dimension is the sum of multiplicities, while the determinant exponent is the sum of weights: the inherited phase action has determinant z⁶¹². A separately selected common output action zI₁₃₇ instead has determinant z¹³⁷. Requiring determinant one then gives 137th roots of unity and the least positive phase fraction 1/137. That closure rule and output action are additional selections, not consequences of forgetting the grading.

Result and the exact physical bridge still required

The result is an exact free record dimension with a discrimination minimum and explicit probability and phase distinctions. Its notation in decimal does not derive a human numeral system. Nor are receiver dimension, probability, determinant fraction and interaction strength the same observable.

For ordinary trace response, a separately derived continuum model can give g_N=s_cont/(4πacN). With N=137, the ideal-model value g_N=1/137 still requires s_cont=4πac and identification of the current and matter sector. That dimensionless normalization cannot be supplied by changing units.

SMM/DTT’s constructive task is to derive the memory grammar, its response weights and its clock–action dictionary from one source. The normalized-coupling problem names this missing theorem. The structural integer should remain distinct from measured electromagnetic values and from any uncalculated holonomy or mass corrections.

Continue with the articles

• From three-dimensional readout to retained records

  A quaternionic readout, ten-mode pair memory, and a selected stopping grammar produce 137 distinguishable records. The construction makes its retention assumptions explicit and leaves physical coupling as a separate problem.

• Why a record count is not yet a coupling

  A receiver's static response depends on its source and inverse stiffness, as well as its size. Exact minimization shows why counting 137 records does not by itself determine an electromagnetic coupling.

• Trace-sector response and the Schur complement

  Allowing hidden traceless modes to relax changes the stiffness seen by a trace source. The Schur complement gives the exact reduced capacity and exposes the normalization still needed for an inverse-rank coupling.

• The conditional ideal value one over 137

  The ideal model value 1/137 requires a selected record count, a trace-response law, and an additional absolute normalization. A hydrogen-like calculation checks their consistency without deriving the measured fine-structure constant.

• Why the symmetric receiver has ten modes

  The symmetric square of a four-component envelope contains four diagonal and six off-diagonal pair modes. Retaining all ten requires genuine pair memory, beyond the information in a quaternionic product.

• Alternating branches and the ranks one, three, seven

  Positive-degree exterior combinations give branch ranks 1, 3, and 7. Combining them with ten-mode continuation memory yields 137 records under a free-retention rule whose losses can be calculated explicitly.

• Two phase actions and determinant closure

  The inherited polynomial phase and a selected common output phase act differently on the same receiver. Their determinant exponents are 612 and 137, so closure claims depend on which action and physical source are chosen.