alpha_pin_under_high_calibration
plain-language theorem explainer
The α-pin theorem establishes that fourth-derivative calibration at zero of the bilinear cost family forces the parameter α to equal 1 when α ≥ 1. Branch-selection work in Recognition Science cites this result to isolate the canonical J-cost from the one-parameter family. The proof first invokes the equivalence that high calibration holds precisely when α² = 1, then applies linear arithmetic under the positivity assumption to conclude α = 1.
Claim. Let $G_α(t) = α^{-2} (cosh(α t) - 1)$. If $α ≥ 1$ and the fourth derivative of $G_α$ at $t=0$ equals 1, then $α = 1$.
background
The Alpha-Coordinate Fixation module isolates the canonical cost by higher-derivative calibration of the bilinear family. CostAlphaLog(α, t) is defined as α^{-2}(cosh(α t) - 1), the α-parameterized cost expressed in logarithmic coordinates. IsHighCalibratedLog(G) is the predicate that the fourth derivative of G at zero equals 1. The module works inside the setting where the branch-selection theorem has already reduced calibrated costs to this one-parameter family with the rigidity convention α ≥ 1. The key upstream equivalence states that IsHighCalibratedLog(CostAlphaLog α) holds if and only if α² = 1.
proof idea
The tactic proof first obtains α ≠ 0 by linear arithmetic. It then applies the equivalence costAlphaLog_high_calibrated_iff to convert the calibration hypothesis into the equation α² = 1. The final step invokes nlinarith on the conjunction of α ≥ 1 and α² = 1 to conclude α = 1.
why it matters
This result supplies the α-pin step inside the certification structure alphaCoordinateFixationCert and is invoked directly by the uniqueness theorem J_uniquely_calibrated_via_higher_derivative to obtain CostAlpha α x = Jcost x. It realises Option 2 of the three candidate fixations listed in the branch-selection paper, using fourth-derivative calibration to force α = 1 and thereby recover the J-cost that appears at T5 of the forcing chain. The other two fixation routes remain open.
Switch to Lean above to see the machine-checked source, dependencies, and usage graph.
papers checked against this theorem (showing 30 of 517)
-
Parabolic Monge-Ampère equations converge without convexity
"For the second order estimate, we will use the test function G(x,t) = log Tr h − Aϕ + B/2 F² ... The key observation is that the differentiation of the F² term will contribute good quadratic third order terms, which can be used to control the bad terms due to the lack of concavity."
-
Density-dependent preytaxis produces bounded solutions and stable equilibria
"If χ(v)=−d′(v), the system becomes ut=Δ(d(v)u)+… (density-suppressed motility)"
-
Variational polaron theory improves heat current accuracy for Ohmic baths
"displacement parameters {f_k,v} ... minimizing the effective free energy upper bound A_B ... F_v(omega) = [1 + tanh(beta_bar Lambda/2) coth(beta_v omega/2) (Delta_R)^2 / (Lambda omega)]^{-1}"
-
New bounds on spectral constants for the quantum annulus
"T extends to ˆT = [T, T(T*T)^{-1/2}β^{1/2}; 0, T^{-*}] with β(ˆT*,ˆT)=0"
-
Decoupling network separates target and jamming in mixed HRRP
"A statistically constrained decoupling module is first developed to generate target-dominant and jamming-dominant latent branches from the mixed HRRP representation."
-
Polish groups' coarse structures metrisable under local boundedness
"A compatible left-invariant metric d on a topological group G is minimal if, for every other compatible left-invariant metric ∂, the map (G,∂)→(G,d) is Lipschitz for short distances."
-
NLS solutions on graphs concentrate on terminal edges
"Ljapunov-Schmidt reduction procedure is performed to construct one-peaked and multipeaked positive solutions"
-
Max-entropy relaxation solves multiway k-cut on graphs
"free energy L … temperature 1/β … as β → ∞, L → D … annealing … phase transitions"
-
Four-dimensional N=2 Liouville theory leaves background charge uncorrected
"Q = 1/b ... Δ_α̃α = -4α̃α + 2Q(α + α̃)"
-
Selective inference yields valid p-values for estimated neuron spikes
"Cost(y1:s,α;γ) admits a recursion... piecewise quadratic functions of α"
-
Geometric split isolates pattern-driving dissipation
"Although such a decomposition is not unique [59–61], we mainly focus on the geometric decomposition because it enables us to extract the part that essentially contributes to time evolution as excess EPR"
-
Proximal minimization produces robust observers for impulsive noise
"Assumptions A.1–A.4... Dt(e) ≤ 0... Σt(e) ≥ α0(∥e∥)"
-
Deep ReLU nets deliver first explicit bounds for metric learning
"construct a structured deep ReLU neural network Fa(1−2∑mi=1ϕ(hi(x),hi(x′))) … complexity … depth, number of nonzero weights, and number of computational units"
-
Power-law ions explain radio phoenix spectra
"Hadronic high-curvature phoenixes require e± heating, by a factor ≳15 if at ICM pressure"
-
Quadratization speeds particle variational inference by skipping interaction updates
"˜F (z, r) = r² + H(z) ... unconditionally energy stable in terms of the modified energy"
-
On-demand TTA makes adaptation practical for edge devices
"decoupled BN update strategy... BN statistics... updated... with larger batch sizes... BN parameters with smaller batch sizes"
-
Spiking networks adapt to shifts by modulating thresholds
"Threshold Modulation module … neuronal dynamics-inspired normalization"
-
PVC films enable reusable stamps for clean 2D heterostructure devices
"We use two commercially available PVC films with distinct pick-up and release temperatures... polymer-to-polymer flake transfers and stack-and-flip fabrication"
-
Drifted CLIP concepts improve meme metaphor detection at lower cost
"Fine-tuning only its Layer Normalization (LN) parameters and position embedding components"
-
Error estimates established for implicit scheme of nonlinear flow
"Assumption 2.10 ... (H3) The exact solution u of (1.1) is Lipschitz-continuous [0,T]→H²(Ω)∩W^s ... (H4) ∇u is Lipschitz-continuous [0,T]→L^∞(Ω)∩W^w"
-
Non-Hermitian holomorphic moments match Hermitian ones by a constant factor
"the holomorphic spectral moments of complex non-Hermitian random matrices coincide with those of their Hermitian limit up to a multiplicative constant, determined by the non-Hermiticity parameter"
-
Framework edits speech amid overlapping background noise
"It can well address the scenario where the frequency bands of voice and background noise are not separated."
-
One pretrained model simulates dynamics for molecules, peptides and proteins
"multi-head pretraining ... Lp = Le I(F=0) + L(k)_o I(F≠0) with separate GVP heads per forcefield"
-
Sub-exponential growth fits most new word diffusion patterns
"α_i = 1 - γ_i / Q (behavioral derivation, Eq. 11)"
-
LoMDM learns generation order jointly with diffusion backbone
"LoMDM jointly learns the generation ordering and diffusion backbone through a single objective from scratch"
-
One network supports many noise paths for discrete sequences
"arbitrary per-token SNR paths γi(t) with continuous non-decreasing contours; mixed ROAR/log-normal training"
-
Tunable Hölder mean lifts GRPO accuracy by 7.2 percent
"Theorem 1: Shannon entropy of W_p attains global maximum at p=0 and strictly decreases as |p| increases; p→±∞ concentrates on argmax/argmin ratios"
-
Fine-tuned detectors amplify a pretrained typicality axis
"closed-form Jacobian predictor parameterises axis-manipulating interventions with R^2 = 1.000"
-
Stochastic rescue recovers signals lost to RLVR clipping
"hard-clipping operation creates a rigid gradient cutoff: any token falling outside the trust region is detached"
-
Rényi DP audits reach information-theoretic optimality up to logs
"Theorem 3.3 ... minimax lower bound ... n ≤ c d / ε² ... packing argument via Gilbert-Varshamov"