5D Library › Spiritual Quotient Quantification, Prior-Conditioned Generation and Retrieval-Augmented Cognitive Agents · 中文

Chapter 1. Five Dimensions or One: The Spectrum and Information of an SQ Scale

An old question

Whether to measure an ability as several dimensions is an argument as old as psychometrics. Spearman held that intelligence tests correlate positively across the board because of one common “general factor” (Spearman 1904); later, confirmatory factor analysis let researchers specify dimensions and their correlations in advance and test them against data (Jöreskog 1969). A common rule of thumb for “how many dimensions” counts the eigenvalues of the correlation matrix that exceed 1 (the Kaiser criterion) (Kaiser 1960).

The author’s spiritual-quotient (SQ) framework has five dimensions: C, physiology and metabolism (engine I); D, neural emotion (engine II); G, game contracts (engine III); F, cycle risk (engine IV); E, execution and growth (engine V). The outline holds that they are orthogonal and that five dimensions explain more variance and carry more information than one. This chapter tests under what conditions that holds.

The eigenvalue spectrum

Take a 20-item questionnaire, 4 items per dimension, each loading 0.7 on its own dimension, with any two dimensions correlated ϕ\phi. The item correlation matrix is R=LΦL′+ΨR = L \Phi L' + \Psi. The program builds this matrix exactly and finds all its eigenvalues by Jacobi rotations (Golub and Van Loan 2013).

Calculation

# Chapter 1. p01: Five dimensions or one? The spectrum of a 20-item scale.
# A spiritual-quotient (SQ) questionnaire has 20 items, 4 for each of
# five dimensions: C physiology and metabolism (engine I), D neural
# emotion (II), G game contracts (III), F cycle risk (IV) and E execution
# and growth (V). Each item loads 0.7 on its own dimension (a CFA model):
#     R = L Phi L' + Psi,
# with every pair of dimensions correlated phi. For phi = 0, 0.3, 0.6
# and 0.9 the program computes the item correlation matrix exactly and
# its eigenvalues by Jacobi rotations. Reported: the six largest, the
# share of variance in the first component and in the first five, and
# how many eigenvalues exceed 1 (the Kaiser count).

LOAD, ITEMS, DIMS = 0.7, 4, 5

def corr_matrix(phi):
    n = ITEMS * DIMS
    r = [[0.0] * n for _ in range(n)]
    for i in range(n):
        for j in range(n):
            if i == j:
                r[i][j] = 1.0
            else:
                same = i // ITEMS == j // ITEMS
                r[i][j] = LOAD * LOAD * (1.0 if same else phi)
    return r

def jacobi_eigs(m, sweeps=60):
    n = len(m)
    a = [row[:] for row in m]
    for _ in range(sweeps):
        off = sum(a[i][j] ** 2 for i in range(n) for j in range(n) if i != j)
        if off < 1e-20:
            break
        for p in range(n - 1):
            for q in range(p + 1, n):
                if abs(a[p][q]) < 1e-15:
                    continue
                th = (a[q][q] - a[p][p]) / (2 * a[p][q])
                t = (1 if th >= 0 else -1) / (abs(th) + (th * th + 1) ** 0.5)
                c = 1 / (t * t + 1) ** 0.5
                s = t * c
                for k in range(n):
                    akp, akq = a[k][p], a[k][q]
                    a[k][p], a[k][q] = c * akp - s * akq, s * akp + c * akq
                for k in range(n):
                    apk, aqk = a[p][k], a[q][k]
                    a[p][k], a[q][k] = c * apk - s * aqk, s * apk + c * aqk
    return sorted((a[i][i] for i in range(n)), reverse=True)

if __name__ == "__main__":
    n = ITEMS * DIMS
    print("   phi  " + "six largest eigenvalues".ljust(35)
          + "    1st    1-5  >1")
    for phi in (0.0, 0.3, 0.6, 0.9):
        ev = jacobi_eigs(corr_matrix(phi))
        print("   {:.1f}  {}  {:.3f}  {:.3f}  {}".format(
            phi, " ".join("{:5.2f}".format(e) for e in ev[:6]),
            ev[0] / n, sum(ev[:5]) / n, sum(e > 1 for e in ev)))
    print("\nReading: with orthogonal dimensions five components carry")
    print("the common variance and one carries a fifth of it. As the")
    print("dimensions correlate, the first component swallows the rest")
    print("and the Kaiser count drops from 5 to 1: whether SQ needs five")
    print("numbers or one is an empirical question about phi, not a")
    print("matter of design.")
#    phi  six largest eigenvalues                1st    1-5  >1
#    0.0   2.47  2.47  2.47  2.47  2.47  0.51  0.124  0.618  5
#    0.3   4.82  1.88  1.88  1.88  1.88  0.51  0.241  0.618  5
#    0.6   7.17  1.29  1.29  1.29  1.29  0.51  0.359  0.618  5
#    0.9   9.53  0.71  0.71  0.71  0.71  0.51  0.476  0.618  1
#
# Reading: with orthogonal dimensions five components carry
# the common variance and one carries a fifth of it. As the
# dimensions correlate, the first component swallows the rest
# and the Kaiser count drops from 5 to 1: whether SQ needs five
# numbers or one is an empirical question about phi, not a
# matter of design.
The ten largest eigenvalues under four dimension correlations. The dashed line is 1.

With orthogonal dimensions (ϕ=0\phi = 0) the first five eigenvalues are equal (2.47), the first component holds only 0.124 of all variance and the five together 0.618; the Kaiser criterion counts 5 dimensions. As the dimension correlation rises, the first eigenvalue grows fast: 7.17 at ϕ=0.6\phi = 0.6, holding 0.359; at ϕ=0.9\phi = 0.9 it is 9.53 while the other four fall to 0.71, and the Kaiser criterion counts only 1 dimension. The variance explained by the five together (0.618) is the same in all four cases; what changes is how it is shared between “one common factor” and “five separate dimensions”.

“Five orthogonal dimensions” is therefore not something designed in but an empirical question about ϕ\phi: if the five dimensions correlate highly in real data, the five scores are five ways of writing one score.

How much more do five scores say than one total?

Even with correlated dimensions, five scores may be more useful than one total – depending on what is to be predicted. The program sets an outcome yy (some later life measure, say) of which the five true dimensions determine half the variance, and compares three predictors: the sum of the five dimension scores (the total), the best single dimension score, and all five scores. For jointly Gaussian variables a predictor carries −12log⁡2(1−R2)-\tfrac{1}{2}\log_2(1-R^2) bits of information about yy (Shannon 1948; Cover and Thomas 2006).

Calculation

# Chapter 1. p02: What five scores add over one: R-squared and bits.
# Same scale as p01 (5 dimensions x 4 items, loading 0.7, dimension
# correlation phi). Each dimension score s_k is the sum of its 4 items.
# An outcome y (some later life measure) depends on the true dimensions,
# y = sum_k w_k f_k + e, scaled so that the dimensions explain half of
# its variance. Two cases: SPREAD (equal weights on all five) and ONE
# (only F, cycle risk, matters). Exact covariance algebra gives the
# share of y explained by the total score T = sum_k s_k, by the best
# single dimension score, and by all five scores (R2 = c' S^-1 c). For
# jointly Gaussian variables the information an estimate carries about
# y is I = -1/2 log2(1 - R2) bits.
import math

LOAD, ITEMS, DIMS = 0.7, 4, 5

def solve(a, b):
    n = len(a)
    m = [row[:] + [b[i]] for i, row in enumerate(a)]
    for c in range(n):
        p = max(range(c, n), key=lambda r: abs(m[r][c]))
        m[c], m[p] = m[p], m[c]
        for r in range(n):
            if r != c:
                f = m[r][c] / m[c][c]
                m[r] = [x - f * y for x, y in zip(m[r], m[c])]
    return [m[i][n] / m[i][i] for i in range(n)]

def case(phi, weights):
    Phi = [[1.0 if i == j else phi for j in range(DIMS)] for i in range(DIMS)]
    v = sum(weights[i] * weights[j] * Phi[i][j]
            for i in range(DIMS) for j in range(DIMS))
    w = [x * math.sqrt(0.5 / v) for x in weights]
    S = [[ITEMS + ITEMS * (ITEMS - 1) * LOAD ** 2 if i == j
          else ITEMS * ITEMS * LOAD ** 2 * phi for j in range(DIMS)]
         for i in range(DIMS)]
    c = [ITEMS * LOAD * sum(w[j] * Phi[j][k] for j in range(DIMS))
         for k in range(DIMS)]
    r5 = sum(ci * xi for ci, xi in zip(c, solve(S, c)))
    r1 = sum(c) ** 2 / sum(sum(row) for row in S)
    rb = max(c[k] ** 2 / S[k][k] for k in range(DIMS))
    return r1, rb, r5

def bits(r2):
    return -0.5 * math.log2(1 - r2)

if __name__ == "__main__":
    print("                    R2                    bits")
    print("   case    phi   total  best one  five    total  best one  five")
    for name, wts in (("SPREAD", [1, 1, 1, 1, 1]), ("ONE", [0, 0, 0, 1, 0])):
        for phi in (0.0, 0.3, 0.6, 0.9):
            r1, rb, r5 = case(phi, wts)
            print("   {:6s} {:4.1f} {:7.4f} {:9.4f} {:6.4f} {:8.4f} {:9.4f}"
                  " {:6.4f}".format(name, phi, r1, rb, r5, bits(r1),
                                    bits(rb), bits(r5)))
    print("\nReading: no single number does both jobs. When the outcome")
    print("draws on all five dimensions, the total matches the five")
    print("scores and any one dimension falls far short; when it hangs")
    print("on one dimension, that dimension matches them and the total")
    print("dilutes it. Five scores are the only choice that is never")
    print("worse, yet nothing here exceeds half a bit.")
#                     R2                    bits
#    case    phi   total  best one  five    total  best one  five
#    SPREAD  0.0  0.3968    0.0794 0.3968   0.3646    0.0596 0.3646
#    SPREAD  0.3  0.4471    0.1746 0.4471   0.4275    0.1384 0.4275
#    SPREAD  0.6  0.4645    0.2698 0.4645   0.4505    0.2268 0.4505
#    SPREAD  0.9  0.4732    0.3650 0.4732   0.4624    0.3276 0.4624
#    ONE     0.0  0.0794    0.3968 0.3968   0.0596    0.3646 0.3646
#    ONE     0.3  0.1967    0.3968 0.4009   0.1580    0.3646 0.3695
#    ONE     0.6  0.3158    0.3968 0.4128   0.2738    0.3646 0.3840
#    ONE     0.9  0.4354    0.3968 0.4465   0.4123    0.3646 0.4266
#
# Reading: no single number does both jobs. When the outcome
# draws on all five dimensions, the total matches the five
# scores and any one dimension falls far short; when it hangs
# on one dimension, that dimension matches them and the total
# dilutes it. Five scores are the only choice that is never
# worse, yet nothing here exceeds half a bit.

The two cases lead to opposite conclusions. If yy depends evenly on all five dimensions (SPREAD), the total does as well as the five scores (both R2R^2 = 0.3968 with orthogonal dimensions) and a single dimension reaches only 0.0794. If yy depends on one dimension (ONE), that dimension does as well as the five scores (0.3968) and the total, diluted by the other four, falls to 0.0794. No single number serves both cases; five scores are the only choice that is “never worse”. But every gain is small: the most informative cell carries only 0.4624 bits, under half a bit.

Hypothesis · not established

The author’s interpretation (not yet tested): the five SQ dimensions correlate no more than 0.3 in real populations, and different life outcomes depend on different dimensions (health outcomes mainly on C, interpersonal outcomes mainly on G, for instance), so a five-dimensional report is more useful than a total. What would show this wrong: if, in a pre-registered sample, the five dimension scores correlated above 0.6 on average, or every outcome depended mainly on the total (with an incremental R2R^2 for the five scores of almost zero), a five-dimensional report would differ in no real way from one total.

Summary

Whether five dimensions are “orthogonal” depends on the dimension correlation in the data: at 0.9 only 1 eigenvalue of 20 items exceeds 1. The advantage of five scores over a total is that they are never worse: equal to the total when the outcome draws on all dimensions, far better when it draws on one. But the gains stay under half a bit.

References

Cover, Thomas M., and Joy A. Thomas. 2006. Elements of Information Theory. 2nd ed. Wiley.
Golub, Gene H., and Charles F. Van Loan. 2013. Matrix Computations. 4th ed. Johns Hopkins University Press.
Jöreskog, Karl G. 1969. “A General Approach to Confirmatory Maximum Likelihood Factor Analysis.” Psychometrika 34 (2): 183–202.
Kaiser, Henry F. 1960. “The Application of Electronic Computers to Factor Analysis.” Educational and Psychological Measurement 20 (1): 141–51.
Shannon, Claude E. 1948. “A Mathematical Theory of Communication.” Bell System Technical Journal 27 (3): 379–423.
Spearman, Charles. 1904. “‘General Intelligence,’ Objectively Determined and Measured.” American Journal of Psychology 15 (2): 201–92.

Fan, Y. (2026). Spiritual Quotient Quantification, Prior-Conditioned Generation and Retrieval-Augmented Cognitive Agents: Multidimensional State Vectors, Personalized Prompt Conditioning and Cross-Corpus Synthesis [五维灵商量化架构、先验条件化生成与检索增强认知体] (Version 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24090203 · Licensed under Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0).