MATH.23:5 - Archetypal Grounding

MATH.23:5.1 - From repeated instances to a family of operations

Repeatedly apply f(x)=a*x+b over real numbers. A few calculations give:

f²(x)=a²*x+(a+1)*b,

f³(x)=a³*x+(a²+a+1)*b.

The useful next question is how to represent any number of repetitions without expanding every substitution. The conjectured formula is:

f^n(x)=a^n*x+b*S_n, where S_0=0 and S_n=1+a+...+a^(n-1) for n>0.

Recover the generating rule. Applying f once more changes the coefficient of x from a^n to a^(n+1), and the constant from b*S_n to b*(a*S_n+1). The identity S_(n+1)=a*S_n+1 therefore supplies the induction step. At n=0, f^0 is the identity and S_0=0. The formula is proved for every natural n.

Now vary the problem: combine two potentially different maps f(x)=a*x+b and g(x)=c*x+d. Their composite is:

f(g(x))=(a*c)*x+(a*d+b).

This constructs an operation on coefficient pairs: (a,b) composed with (c,d) gives (a*c,a*d+b). The class is closed under composition. MATH.17 can study this operation; a computational method can use it to combine repetitions.

Order now becomes a useful question. Reversing the maps gives the same linear coefficient but constant c*b+d. Thus they commute exactly when d*(a-1)=b*(c-1). This condition says when reordered operations retain the result.

The progression has produced a general iteration formula, a closed combining operation and a condition for rearrangement. A further question about vector-valued affine maps needs its matrix composition law; scalar commutation cannot be silently carried into that new setting.

MATH.23:5.2 - A failed combination produces a better summary and another conjecture

A computation stores the arithmetic mean of each nonempty group of real numbers. The proposed combining operation takes the mean of those means. For groups [0] and [2,4], it returns (0+3)/2=1.5, while the combined group has mean 2.

Inspect the missing mathematical relation. Each group mean gives a total only when its group size is known. Equal group sizes make the proposed operation work, but arbitrary groups require another construction.

Retain a sum s and count n. Combine (s,n) and (t,m) as (s+t,n+m), then return (s+t)/(n+m) when n+m>0. Associativity and commutativity follow from those of addition in both coordinates; (0,0) is an identity. Thus grouping and order of the combination do not change the final mean in real arithmetic. A finite-precision implementation needs its own error account.

The construction opens a broader mathematical question: Which summaries permit the summary of a combined input to be computed from the two summaries alone?

Let q map a collection of finite lists, closed under concatenation, to proposed summaries; let ++ concatenate lists. Means and medians here use nonempty lists, while sum and count also admit the empty list. A necessary condition is:

if q(u)=q(u’) and q(v)=q(v’), then q(u++v)=q(u’++v’).

It is also sufficient for defining a combining operation on attained summaries: choose lists representing the two summaries and apply q to their concatenation. The condition makes the result independent of those choices. This proves mathematical existence of the operation. Computing it from a concrete representation of the summaries still needs an effective rule. MATH.2 develops the compatible identification; MATH.12 and CMP handle obtaining the operation.

For means alone, take u=[0], u’=[0,0], and v=v’=[6]. The input summaries match, but the concatenated means are 3 and 2. The necessary condition fails. Sum and count repair it by an explicit operation.

Now ask whether median and count suffice. Take u=[0,1,100] and u’=[-100,1,2]. Each has count 3 and median 1. Append the same list [50,50]. The resulting five-element medians are respectively 50 and 2. This new conjecture is refuted by the same method.

The next useful problem concerns what more to retain. Sorted full lists are sufficient and can be merged, while a use requiring less storage can ask for a restricted input class or an approximate median with a stated error. The mathematical obstruction now informs a computational and modeling choice.

MATH.23:5.3 - A failed limit argument reveals a stronger condition

Consider the claim that a pointwise limit of continuous real functions is continuous. On [0,1], let f_n(x)=x^n for positive natural n. Each function is continuous. At any fixed x<1, x^n tends to zero; at x=1 it equals one. The limit f is zero below one and equals one at one, so it is discontinuous.

Locate the failed proof step. Pointwise convergence lets the approximation index depend on x. Continuity near a point needs control over nearby x together. Choosing a good approximation at the one point alone does not control its neighborhood.

This suggests a sufficient condition: uniform convergence. For every positive error allowance, one index makes all later approximations close to f at every point of the domain.

Work the proposed repair. Fix a point x0 and an error allowance e>0. Choose N so that the approximation error between f_N and f is less than e/3 everywhere. Continuity of f_N gives a neighborhood of x0 in which the difference between f_N(x) and f_N(x0) is less than e/3. The triangle inequality bounds the difference between f(x) and f(x0) by these three errors, hence by e. This proves continuity of f at x0.

The repaired theorem supplies a condition for transferring continuity. Here proof analysis discovered which quantifier change made the desired inference possible. A subsequent limit construction can use the proved condition to retain continuity.

Uniformity is sufficient, not necessary. On the domain [0,1), the same x^n sequence has the continuous limit zero, but convergence is not uniform: for every n there is an x<1 with x^n=1/2. The next question can therefore seek a weaker condition suited to the receiving use, rather than treating uniform convergence as the definition of every acceptable limit.