Isaacs (1951) and Werbos (1988) share a mechanism — a scalar terminal quantity's gradient carried backward along a path — but no documented transmission line: the resemblance is real at the level of adjoint/costate structure and absent at the level of citation

bipartite-bridgerufus-isaacspaul-werbosbackpropagationdifferential-gamesdynamic-programmingadjoint-methodcostateordered-derivativesoptimal-controlfalse-friend-test

Bridge-seed check. No capture in 10-inbox/raw/ mentions both claim-isaacs-1951-rand-paper-precursors-maximum-principle and claim-werbos-1988-rhw-special-case-of-dynamic-feedback; no sibling to defer to. Adjacent captures were read for collision: 2026-08-22-hop-isaacs-rand-precursor-bridge (source of the Isaacs claim) and 2026-09-17-does-rufus-isaacss-own-1951-rand-report-p (read P-257 for colleague names only; did not read its equations). The vault already links the two ends indirectly through claim-backprop-special-case-kelley-bryson-formula, claim-kelley-bryson-optimal-control-precursor and moc-backpropagation-origins; this capture reads P-257's mathematics against Werbos's 1988 mathematics, which no prior note does.

Verdict: not a false friend, but not a lineage either. A shared structure exists and is documented in both primaries' own words; a transmission path from Isaacs to Werbos is not documented in Werbos's own reference list.

Claim: Isaacs's P-257 derives its optimal paths as characteristics of a first-order PDE for the game's value, with half the characteristic equations obtained by differentiating that PDE — a backward-carried gradient of the value along a path

Claim type: technical-mechanism → Tier 1 required; met (own 1951 report, read in full via extract_pdf/OCR, tls verified).

In Games of Pursuit, Isaacs states a "Tenet of Transition": "If the play proceeds from one position to a second and V is thought of as known at the second, then it is determined at the first by demanding that the players optimize (i.e., make minimax) the increment of V during the transition" (OCR text; the scan renders "pleyers", "meke minimex"). He states that "In the discreet case the tenet leads to a recurrence relation and in the continuous, to a differential equation" (OCR "discreet" = discrete). For the discrete worked example (Game II, the "Hamstrung Squad Car") the construction is retrograde: label the capture states V=0, then all states from which one move reaches them V=1, and so on to n+1 — value computed backward from the terminal set. For the continuous case: equating two expressions for the rate of change of V along an optimal path gives "a first order partial differential equation for V called the main equation," and "Its characteristics turn out to be the optimal paths. Half the characteristic equations are the kinetic equations; the other half are simply obtained by differentiating the main equation with respect to each of the navigation variables." In the worked example (Game III, the Isotropic Rocket) differentiating the main equation yields equations (8), and he notes "Comparing the sum to (4) we see that it is the derivative of T_z along the path with respect to t" — i.e., the partial derivatives of the value are themselves propagated along the path by ordinary differential equations. The paper never uses the words "adjoint," "costate," or "Lagrange multiplier," and never cites Bellman or a control-theory text.

The discrete retrograde labelling is the dynamic-programming recurrence; the continuous characteristic system is the structure that later literature calls the maximum principle's state-plus-costate system — but that identification is an inference from the later literature, not something P-257 states (see commentary; the reading of P-257 as a "precursor" rests on claim-isaacs-1951-rand-paper-precursors-maximum-principle's Breitner source, which says "rudimentary").

verifies: []

Claim: Werbos's 1988 "dynamic feedback" is a backward recursion of ordered derivatives that he himself equates with control theory's time-dependent Lagrange multipliers and calls "very similar to earlier methods from control theory"

Claim type: technical-mechanism → Tier 1 required; met (Werbos's own paper, extract_pdf, sha256 above, tls verified).

Werbos defines first-order dynamic feedback as "the use of the chain rule for ordered derivatives, in order to calculate the derivatives of L with respect to the system inputs" (p. 342), evaluated as a recursion that begins at the last variable and proceeds "backwards to x_{N-1}, x_{N-2}, on down to x_1" (p. 342). He lists the same object under other names: "economists speak of impact multipliers, control theorists speak of variational derivatives, and many people speak of time-dependent Lagrange multipliers" (p. 342). For the time-lag case he writes: "This method of calculating derivatives is very similar to earlier methods from control theory" (p. 349), and of the recurrent generalization that it "could have been derived as a generalization of the 'adjoint' method used by Alsmiller et al. (1981)" (p. 348). On the origin (p. 341): Werbos (1974) "also cited related work in control theory, which also used backwards flows of information to identify systems"; "The formulation to be given below could have been derived as an extension of control theory, but I found it easier simply to prove (9) directly"; and "a reviewer has suggested that Athans and Kalb (1966) came surprisingly close to the kind of approach presented here." He also imports dynamic programming directly on the reinforcement-learning side: "The J function comes from dynamic programming" (p. 345). The p. 342 sentence "In brief, the RHW feedforward networks are a special case of equations 7 and 8" is the containment already carried by claim-werbos-1988-rhw-special-case-of-dynamic-feedback; the containment is over network topology (any ordered system, then recurrent ones), not over optimal control.

Werbos here supplies the bridge's other half in his own voice: the operation he calls dynamic feedback is, by his own account, the same operation control theorists perform with time-dependent multipliers. Isaacs's second half of the characteristic equations is a member of that family (value-gradient carried along a path), so the resemblance is a shared mechanism, not a shared word.

Claim: Werbos's 1988 reference list contains no Isaacs, Bellman, Pontryagin, Kelley, or Bryson — the documented control-theory lines run through Athans & Kalb (1966) and Oak Ridge adjoint sensitivity work, not the differential-games school

Claim type: historical / negative → escalated to Tier 1 because it is the load-bearing point of this capture; met by reading the paper's own bibliography.

The complete reference list of Werbos (1988), pp. 356 (read in full), includes Almeida 1987; Alsmiller et al. 1981 ("Adjoint sensitivity analysis and its application to LEAP Model 22c," ORNL/TM-7789); Athans & Kalb 1966 (Optimal control theory, McGraw-Hill); Barto/Sutton/Anderson 1983; Dennis & Schnabel 1983; Forsythe & Moler 1967; Parker 1985; Pineda 1987; RHW 1986; and Werbos's own works. It lists no work by Isaacs, Bellman, Pontryagin, Kelley, or Bryson. (The body text was read for lines 1–743 of 1,209 of the extracted text plus the bibliography; a term search of the unread middle section was not possible in this session, so a body-text mention of those names in pp. 350–355 is not ruled out — [unverified — body pp. 350–355 not searched].) Therefore no documented transmission path from Isaacs's 1951 RAND paper to Werbos's formulation appears in the primary that would carry it. The path that Werbos does document is: control-theory backward flows (Athans & Kalb; adjoint methods) → dynamic feedback (1974), plus dynamic programming for the J function (HDP/DHP).

verifies: []

Claim: the two vault notes use "precursor/special case" in different senses, so cosine similarity of 0.84 overstates identity of what is claimed

Claim type: definitional reading of the two vault notes; supported by the two primaries above.

The Isaacs note claims historical anteriority of a mathematical structure (value function + backward recurrence + characteristic system) in a game-theory report; the Werbos note claims logical containment of one algorithm in a more general one, argued by the algorithm's own author. What they share is not the claim but the object: a scalar payoff/loss whose gradient with respect to earlier quantities is computed by a backward sweep. That object has at least four separately-named homes — Isaacs's value-gradient characteristics, Pontryagin's costates, Bellman's dynamic programming recurrence, and adjoint sensitivity analysis — which is why the resemblance is real yet can be produced without any citation link between the endpoints. The vault's existing "same algorithm?" seam (claim-backprop-special-case-kelley-bryson-formula vs claim-kelley-bryson-optimal-control-precursor) applies here unchanged, one step further back.

Further leads

• Werbos 1988 body pp. 350–355 not searched for Isaacs/Bellman/Pontryagin names — locally re-read the cached text at cache/sources/1c5be985…txt lines 744–1099.
• Werbos, "Backpropagation: Past and future" (IEEE ICNN 1988, cited in the 1988 paper as Werbos 1988b) — a likelier place for a fuller lineage statement; unread.
• Isaacs, Differential Games (Wiley, 1965) — his own later statement of the retrograde-path equations and any Bellman/Pontryagin priority remarks; unread.
• Bellman's dynamic-programming/Hamilton–Jacobi–Bellman relation to Pontryagin costates (Bellman 1957; Pontryagin et al. 1962 translation) — needed to source the "standard later reading" flagged in the commentary.
• Athans & Kalb (1966) Optimal control theory — the book Werbos's reviewer named; Werbos says he had never seen it.
• Alsmiller et al. (1981), ORNL/TM-7789, adjoint sensitivity analysis of the LEAP model — the actual documented adjoint precursor Werbos was aware of; OSTI likely hosts it.

Entity candidates

• Rufus Isaacs — person — foundational figure the capture measures Werbos against; P-257's "tenet of transition" and characteristic system are the 1951 mechanism (vault page exists: entity-rufus-isaacs).
• Richard Bellman — person — dynamic programming; Werbos's J function "comes from dynamic programming" (vault page exists: entity-richard-bellman).
• Lev Pontryagin — person — costate/maximum-principle side of the shared mechanism (vault page exists: entity-lev-pontryagin).
• Michael Athans — person — co-author of Optimal control theory (1966), the control text Werbos's reviewer said came "surprisingly close" to his approach.
• Peter L. Kalb — person — co-author of the same 1966 book.
• R. G. Alsmiller — person — lead author of the 1981 Oak Ridge adjoint sensitivity report Werbos says he knew of.
• Luís B. Almeida — person — 1987 recurrent-backprop method Werbos says his own is "closely related to".
• Tenet of Transition — term — Isaacs's 1951 name for the dynamic-programming principle in games.
• Main equation (Isaacs) — term — Isaacs's name for the first-order PDE for the value, whose characteristics are the optimal paths.
• Ordered derivatives — concept — Werbos's chain-rule construct; his equivalent of time-dependent Lagrange multipliers/impact multipliers.
• Dynamic feedback — term — Werbos's name for the backward-derivative component of backpropagation.
• Adjoint method / costate — concept — the shared object across Isaacs, Pontryagin, Werbos.
• Homicidal Chauffeur — term — Isaacs's canonical worked game in P-257.
• Heuristic dynamic programming (HDP) — concept — Werbos's adaptive-critic method that imports Bellman's J function into backprop.

Safety flags

None. Both primaries (RAND P-257 via Wayback, Werbos 1988 via gwern.net PDF) were ordinary technical prose; no addressed-to-AI language, override language, claimed authority, tier self-assignment, file-system instructions, credential requests, or urgency framing. Both extractions recorded tls: verified.