- NOTE: AngouriMath is deprecated; read more -
-diff --git a/src/content/quickstart/index.html b/src/content/quickstart/index.html index 20319332f..4b6cbcda3 100644 --- a/src/content/quickstart/index.html +++ b/src/content/quickstart/index.html @@ -39,12 +39,15 @@
dotnet add package AngouriMath.FSharp
- The current release is 2.1.0, and both it and 2.0.0 change answers that earlier versions
+ The current release is 2.5.0, and every 2.x release changes answers that earlier versions
got wrong. Whichever version you are coming from, read
BREAKING-CHANGES.md
first: it lists every input whose result is now different, with the old value and the new one,
- under a heading per release. 2.1.0 is a drop-in replacement for 2.0.0 — the assembly version is
- pinned at 2.0.0.0 for the whole of 2.x.
+ under a heading per release, and says whether the change is silent — the call still
+ succeeds and returns something else — or loud. The assembly version is pinned at
+ 2.0.0.0 for the whole of 2.x, so each release binds in place of the last; since
+ 2.0.0 only 2.2.0 renamed members, two of them, and no other release removes anything a caller
+ can hit. What each release did is on the What's new page.
The library targets netstandard2.0, net8.0 and net10.0.
diff --git a/src/content/whatsnew/index.html b/src/content/whatsnew/index.html
index 5ef8f61fe..33f23f361 100644
--- a/src/content/whatsnew/index.html
+++ b/src/content/whatsnew/index.html
@@ -34,7 +34,165 @@
+ Tier 2 of the Math OS roadmap —
+ the rewrite graph — is finished. An e-graph lives in the kernel rather than in a measurement
+ harness, every one of the thirty registered rule sets runs as data through a real e-matcher, and each
+ rule declares its own soundness tier and how much it grows what it matches. The honest result is the
+ part worth reading: Simplify still does not run on the graph, because the tier
+ asked for equality saturation to be evaluated against memory cost on real expressions and the
+ evaluation came back negative. A measurement that says "not by default" is the deliverable.
+ Every changed answer is in
+ BREAKING-CHANGES.md
+ under 2.5.0 — since 2.4.0 — seventy-six entries, twenty-nine of them silent
+ (the call still succeeds and quietly returns something else) and two loud, where input that
+ parsed now raises. The recorded public surface has 136 additions and no removals, and
+ AssemblyVersion stays 2.0.0.0: source- and binary-compatible with 2.4.0.
+
+ Wrong answers fixed:
+
Integrate could recurse without bound and take the process down — a stack overflow is not an exception a caller can handle. Caught by running Rubi's independent suites against the release candidate; the descent is bounded now, and an integral already being worked out is recognised as a cycle, after renaming, and declined at once.Domain.Any was treated as the universal set when it is a codomain.arccotan was not negative — this library's arccotan has range (-pi/2, pi/2], and a guard written from the textbook range shipped wrong.z / abs(z) lost the phase of z, and a factor of -1 was taken out as though it were a factor rather than read as a sign.record you pass (SmallestTree, FewestDivisions, FewestRadicals) rather than a setting you set.SolveHard allocates 98.6% less: the solver tries the equation as written before asking for its alternatives.SimplifyHard −64%, −44%, −35% and −25% over four changes: a candidate registered once, a subtree costed once, a sort key spelt once, and a candidate re-simplified at the default level whatever level it was offered at.a divides b is a statement node (a \mid b in LaTeX) — divides is a keyword now, so a variable of that name no longer parses.#S is the number of elements of a set, with card(S) still accepted; the extremum of an expression over a set is a binder; and a lambda is written with an arrow, x => x + 1 beside lambda(x, x + 1).sum(k, k, 1, n) is (n + n^2)/2 with its condition on n; sum(x^k, k, 0, +oo) is 1 / (1 - x) provided abs(x) < 1; sum(2^k, k, 0, +oo) is +oo by the nth-term test. Polynomial summands, monomial products, a power over a factorial, binomial sums, geometric and divergent series.
+ Tier 1 of the Math OS roadmap
+ is finished, and the thing that finished it kept finding wrong answers: writing a rewrite rule out
+ as data — a pattern and a replacement, rather than an arm of a switch — makes
+ the correspondence between the two something you have to state, and four times this cycle a rule
+ did not survive stating it.
+ Every changed answer is in
+ BREAKING-CHANGES.md
+ under 2.4.0 — since 2.3.0 — twenty-seven entries, more than half of them silent.
+ AssemblyVersion stays 2.0.0.0; the 130 recorded removals are
+ Stringize() and Latexize() ceasing to be abstract per node,
+ still public on Entity and inherited by every node, so nothing a caller can hit.
+
+ Wrong answers fixed:
+
Factor("4x² − 4y²", "x") returned (x + y)(x − y), the 4 simply gone: every candidate factor was checked by exact division, but nothing compared the assembled product against the input.(y < x) or (x = y) simplified to x <= y, its own negation off the diagonal — four of the eight or-with-equality rules carried their neighbour's comparison, reachable only with both operands symbolic.x! = 0 was False everywhere, including at the negative integers where the factorial has a pole and the statement is NaN; x! / x! → 1 went with it.ln(1/b) = −ln(b) was applied unconditionally, and is false on the negative reals by a full turn of the argument.Factorize was built entirely out of rewrite rules while square-free decomposition, Zassenhaus over ℚ and the multivariate GCD sat unused. Now x^3 - 1 is (x - 1) * (x^2 + x + 1), x^4 - 5x^2 + 4 is (x + 1) * (x + 2) * (x - 2) * (x - 1) and x^2 + 2x + 1 is (x + 1)^2; every answer the rules already gave is unchanged.x^12 - y^12 gives its full cyclotomic split, x^7 - y^7 its two factors, and a polynomial the layer can prove irreducible is returned rather than refused.switch it replaces over thousands of generated expressions; twenty-seven run it, and the three that do not are the canonical orders. 407 individually addressable rules, 181 Sound, 141 SoundUnderAssumptions, 26 readable backwards.SimplifyEasy is about 13% slower than before the exchange, 82,676 ns to 93,732 ns on one desktop: every conversion measured free against the commit in front of it, nothing measured against the start, and the sum of a run of free steps was +13%. Indexing each set's rules by node type recovered most of it. The same document records that the CI kernel benchmark run twice on one commit is 30–57% apart on every row, while allocation agrees to 0.03% — so its timing columns are evidence only above about 50%.
+ A correctness release, and the first whose claim to that is measured on an outside corpus:
+ against Rubi's integration suite — 1774 problems that each carry an antiderivative known to
+ exist — it answers 604 where 2.2.0-era master answered 536, and gets 0 wrong where that answered 7,
+ six of the seven being NaN, a definite claim that no value exists made about integrals
+ that have one.
+ Every changed answer is in
+ BREAKING-CHANGES.md
+ under 2.3.0 — since 2.2.0. This release removes and renames nothing — 103 additions
+ and 0 removals against the 2.2.0 public API — so it is a drop-in replacement in both the binding and
+ the source sense, which 2.2.0 was not.
+
+ Wrong answers fixed:
+
NaN for ordinary matrices: Gaussian elimination left the pivots as literal divisions, undefined wherever a pivot vanishes. It is Laplace expansion now, which never divides, and is faster.BB, ZZ, QQ, RR, CC — because "might this be a member" was reported as "is a member".pi or e behaved as though they varied: sin(pi) by MathS.pi was -1, and is 0. And a bound pi or e still carried the constant's value, so derivative(e^2, e) was 0 — a name a binder declares is a variable.Differentiate(x, n) returned raw, compounding chain-rule output for n >= 1; differentiating or integrating over a number renamed it and answered a question nobody asked.ToSympyCode emitted Python that does not run for every set, lambda, piecewise and non-vector matrix. Measured by executing the generated program: 24 of 45 ran before, 45 of 45 run now."{ k : k > 0 }".FreeVariables was { %1 }.Rational it denotes, so Stringize of a Rational round-trips.SolveEasy is 21.3 ms to 8.5 ms with a 2.3× allocation drop beside it, which is how you tell work from machine noise.
+ An infrastructure release: a real polynomial layer, and a written specification of what
+ canonical form means here with both halves implemented. The corrected answers in it are mostly
+ consequences of those two.
+ Every changed answer is in
+ BREAKING-CHANGES.md
+ under 2.2.0 — since 2.1.0. AssemblyVersion stays 2.0.0.0;
+ see the rename at the bottom before dropping the DLL in without recompiling.
+
+ A polynomial layer:
+
x^5 + 2x^3 - 2x^2 - 4 returned three of its five roots, one a float, and returns all five, exact.1/(x^4 + 3x^2 + 2) and 1/(x^4 + 4) integrate instead of coming back unevaluated.Docs/Contributing/CanonicalForm.md states the position: canonical is about identity, simplest is about presentation, and there is no canonical form for the whole language, since zero-equivalence is undecidable once pi, exp, the trigonometric functions and abs are in play.Entity.Canonicalize() (the commutative structure: 0 idempotence and 0 order-independence failures over 834 expressions) and Entity.CanonicalizeAsRationalFunction() (rational functions over ℚ, or null — the library saying it has no answer rather than guessing). Nothing applies by default: Simplify returns exactly what it returned before.sin(-x) + sin(x) was left as written and is 0; cos(-x) and abs(-x) fold too.InnerSimplified is idempotent again: an exact trigonometric value reached through a half turn came back as -(-1).log(x, x) was 1 provided x > 0, NaN at every negative x; d/dx x^n carried a provided x > 0 it never needed; a sum of logarithms is gathered only where that is exact, and the two limits lost to that guard in 2.1.0 are back.Transformation.Rationalisation is Rationalization and RewriteRules.RationaliseDenominator is RationalizeDenominator, on a surface that is otherwise Factorize, Latexize. Recompiling turns a stale reference into a compile error; swapping the DLL without recompiling throws MissingMethodException when the call is reached.A correctness release. Almost everything below is a wrong answer becoming a right one, and most of it was found by harnesses rather than reported — boundary points where a rule's assumption fails,