5D Library › Persuasive Copywriting Algebra, Loss-Framing Asymmetry and Checkout Micro-Architecture · 中文

Chapter 5. The Full Ledger of a Fear Frame: Refunds, Chargebacks and Repeat Purchases

A complete ledger

The effect of copy is not only the conversion rate of the moment. A line implying “if you don’t buy you will lose something”, where the loss is not something buying can avert, is discovered afterwards by buyers and shows up as refunds, card chargebacks (each with a fee) and complaints. Per 1,000 visitors, at a price of RM 49 and a baseline conversion of 3%, the program compares four versions; the conversion multipliers, refund and chargeback rates and complaint costs are illustrative parameters.

Calculation

# Chapter 5. p09: The ledger of a fear frame - refunds, chargebacks, risk.
# Per 1,000 visitors at RM 49. A copy variant raises conversion by a
# factor m but, if it implies a loss the product will prevent, raises the
# refund rate r, the chargeback rate b (fee RM 60 each, plus the sale)
# and the expected cost of complaints (probability per sale x cost).
# Net revenue = sales x (49 (1 - r - b) - 60 b - complaint cost).
def net(visitors, conv, m, r, b, comp_p, comp_cost, price=49.0, fee=60.0):
    sales = visitors * conv * m
    return sales, sales * (price * (1 - r - b) - fee * b - comp_p * comp_cost)

if __name__ == "__main__":
    base_conv = 0.03
    rows = (("honest gain frame", 1.00, 0.03, 0.002, 0.000, 0),
            ("loss of access (deadline)", 1.08, 0.04, 0.003, 0.000, 0),
            ("implied loss of fortune", 1.25, 0.12, 0.015, 0.002, 5000),
            ("implied loss, heavy", 1.50, 0.20, 0.030, 0.004, 5000))
    print("   variant                     sales   net RM   vs honest")
    ref = None
    for name, m, r, b, cp, cc in rows:
        s, v = net(1000, base_conv, m, r, b, cp, cc)
        ref = ref or v
        print("   {:26s} {:6.1f}  {:7.2f}   {:+.1%}".format(name, s, v,
                                                         v / ref - 1))
    print("\n   break-even complaint probability, 'implied loss'"
          " (m 1.25):")
    s, v0 = net(1000, base_conv, 1.25, 0.12, 0.015, 0, 0)
    _, vh = net(1000, base_conv, 1.00, 0.03, 0.002, 0, 0)
    print("     {:.4f} per sale at RM 5000 per complaint".format(
        (v0 - vh) / (s * 5000)))
#    variant                     sales   net RM   vs honest
#    honest gain frame            30.0  1419.36   +0.0%
#    loss of access (deadline)    32.4  1513.50   +6.6%
#    implied loss of fortune      37.5  1180.69   -16.8%
#    implied loss, heavy          45.0   716.85   -49.5%
#
#    break-even complaint probability, 'implied loss' (m 1.25):
#      0.0007 per sale at RM 5000 per complaint

An honest gain frame nets RM 1419.36; framing with a real loss concerning the report itself, “the offer ends”, with a multiplier of 1.08 and slightly higher refunds, nets RM 1513.50 (+6.6%); copy implying “loss of luck”, even with a multiplier of 1.25, nets 16.8% less once refunds, chargebacks and complaint costs are counted; a more aggressive version nets 49.5% less. Even without counting complaints at all, once the probability that a sale draws a complaint exceeds 0.0007 (at RM 5,000 per complaint), implied-loss copy does worse than honest copy.

Repeat purchases: promises tested by experience

Calculation

# Chapter 5. p10: Repeat purchase when claims are checked by experience.
# A buyer's trust t (probability the next claim is true) starts at a
# Beta(a, b) prior with mean 0.6 and is updated after each purchase by
# whether the copy's promise was experienced as kept (probability k).
# Repurchase probability each month = 0.5 x current mean trust. We
# compare copy whose promise is about the product itself (kept 0.9)
# with copy implying outcomes the product cannot secure (kept 0.3).
import random

def ltv(kept, months=12, price=49.0, trials=20000, seed=77010):
    rng = random.Random(seed)
    total = 0.0
    for _ in range(trials):
        a, b = 3.0, 2.0
        rev = price                                 # first purchase
        for _ in range(months - 1):
            if rng.random() < 0.5 * a / (a + b):
                rev += price
                if rng.random() < kept:
                    a += 1
                else:
                    b += 1
        total += rev
    return total / trials

if __name__ == "__main__":
    for name, k in (("promise about the product", 0.9),
                    ("mixed", 0.6), ("implied outcome", 0.3)):
        print("   {:26s} kept {:.1f}: 12-month value RM {:6.2f}".format(
            name, k, ltv(k)))
    # per 1,000 visitors, with conversion and refund rates of p09
    honest = 1000 * 0.03 * 1.00 * ltv(0.9) * (1 - 0.03 - 0.002)
    implied = 1000 * 0.03 * 1.25 * ltv(0.3) * (1 - 0.12 - 0.015)
    print("   per 1,000 visitors after refunds and chargebacks:")
    print("     product promise RM {:,.0f}; implied outcome RM {:,.0f}"
          .format(honest, implied))
#    promise about the product  kept 0.9: 12-month value RM 228.26
#    mixed                      kept 0.6: 12-month value RM 211.17
#    implied outcome            kept 0.3: 12-month value RM 196.19
#    per 1,000 visitors after refunds and chargebacks:
#      product promise RM 6,629; implied outcome RM 6,364

The second dimension is repeat purchase. The program lets a buyer’s trust in the seller update after each purchase by experience: promises about the product itself (“the report contains these calculations”) are experienced as kept with high probability (0.9); promises about outcomes (“you will avoid losses”) with low probability (0.3). One year’s value per buyer is RM 228.26 and RM 196.19. Per 1,000 visitors, net of refunds and chargebacks, the honest promise yields RM 6,629 and the implied outcome RM 6,364: the extra first sales of the latter are offset by lower repeat purchase and higher refunds, before complaints and legal risk are counted.

Evidence

Legal limits. Malaysia’s Consumer Protection Act 1999 prohibits misleading or deceptive representations in trade (Laws of Malaysia 1999); pre-ticked boxes, hidden costs and fake countdown timers have been systematically documented as “dark patterns” in large-scale crawls of shopping sites (Mathur et al. 2019). A product whose own publications state that they “neither claim nor test that any reading comes true” cannot imply on its sales page that buying averts real losses.

Summary

Under this book’s illustrative parameters, “real losses” (deadlines, places) net more than “implied losses” (luck, fortune); implied-loss copy may raise first sales by a quarter, but refunds, chargebacks and lower repeat purchase offset it, and all the legal risk falls on that side.

References

Laws of Malaysia. 1999. Consumer Protection Act 1999 (Act 599). Part II: Misleading and deceptive conduct, false representation and unfair practice.
Mathur, Arunesh, Gunes Acar, Michael J. Friedman, et al. 2019. “Dark Patterns at Scale: Findings from a Crawl of 11K Shopping Websites.” Proceedings of the ACM on Human-Computer Interaction 3 (CSCW): 81:1–32.

Fan, Y. (2026). Persuasive Copywriting Algebra, Loss-Framing Asymmetry and Checkout Micro-Architecture: Prospect-Theory Valuation Ratios, Numerical Specificity Credibility and Cognitive-Fluency Conversion Bounds [说服文案代数、损失框架不对称性与结账微界面工程] (Version 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24090205 · Licensed under Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0).