What does Formalising Founder Wishes conclude, in numbers, about “Constraint Inversion: Weakest Preconditions, Elimination and Arc Consistency”?

Answer: Chapter 3 back-substitutes through the revenue identity: a net of 3,000 needs at least 201 orders and 10,048 visits, and elimination under capacity and budget constraints bounds the net at 2,412.0, so the wish contradicts itself.

Scope of the numbers: Amounts are in illustrative units with no currency, parameters are illustrative, and all calculations are generated by the book's programs. The book is non-personalised business guidance, not personal financial or investment advice; the psychological literature is reported only as associations with their conditions, and the lower end of an interval is never a promise of income.

中文版

Data table

The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python onlyprinted values that match the answer: 10048, 201, 3000

wp(net >3,000):
contribution >4,200
orders >4,200 / 20.9 = 200.96 -> 201
visits >200.96 / 0.02 = 10,047.8 -> 10,048
visits needed per month (net target 3,000)
conv aov 28 aov 38 aov 48
0.0127,273 20,096 15,910
0.0213,637 10,048 7,955
0.039,091 6,699 5,304
Show the full program
# Chapter 3. p31: weakest-precondition back-substitution of a net target
# Identity: net = visits * conv * aov * margin - fixed. Exact Fractions.
# Going backwards from "net >= target" gives, step by step, the weakest
# condition on contribution, then orders, then visits. Units carry no
# currency; every parameter is illustrative for a direct book shop:
# fixed cost 1,200, order value 38, margin 0.55, conversion 0.02.
import math
from fractions import Fraction as F

TARGET = F(3000)
FIXED = F(1200)
AOV = F(38)
MARGIN = F(55, 100)
CONV = F(2, 100)

contrib = TARGET + FIXED
unit = AOV * MARGIN
orders = contrib / unit
visits = orders / CONV
print("wp(net >= {:,}):".format(int(TARGET)))
print("  contribution >= {:,}".format(int(contrib)))
print("  orders >= {:,} / {} = {:.2f} -> {}".format(
    int(contrib), float(unit), float(orders), math.ceil(orders)))
print("  visits >= {:.2f} / {} = {:,.1f} -> {:,}".format(
    float(orders), float(CONV), float(visits), math.ceil(visits)))
print()
print("visits needed per month (net target {:,})".format(int(TARGET)))
print("{:>8}".format("conv") + "".join(
    "{:>10}".format("aov " + str(a)) for a in (28, 38, 48)))
for c in (F(1, 100), F(2, 100), F(3, 100)):
    row = "{:>8.2f}".format(float(c))
    for a in (28, 38, 48):
        need = contrib / (F(a) * MARGIN * c)
        row += "{:>10,}".format(math.ceil(need))
    print(row)

Single source and citation

Fan, Y. (2026). Formalising Fuzzy Founder Wishes: Constraint Inversion, Falsifiable Spec Synthesis and Executable Revenue System Compilation (Version 1.0.0), Chapter 3: Constraint Inversion: Weakest Preconditions, Elimination and Arc Consistency. 5D Library. DOI pending

DOI pending · monograph page goes live after publication · 5DL-B-414 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026414,
  author    = {Fan, Yafu},
  title     = {Formalising Fuzzy Founder Wishes: Constraint Inversion, Falsifiable Spec Synthesis and Executable Revenue System Compilation},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book