Skip to content

Releases

v0.2.3 — Ordered Heyting Field Interface

Choose a tag to compare

@Ontarch Ontarch released this 05 Nov 00:13

adds the missing structure — apartness, explicit division, infimum, and
the stdlib bundle layer — so that the interval reals are now exposed as
a complete Archimedean Heyting field with a ℚ embedding.

Highlights

- Explicit division: Real.Interval.Division, Division.Laws.
  /ℝ is defined as multiplication by the reciprocal; the module proves
  reciprocal uniqueness, congruence, cancellation (*ℝ-/ℝ, /ℝ-*ℝ,
  *ℝ-cancel), self-division, cross-multiplication, common-denominator
  addition, associativity, cancellation of common factors, the
  zero-quotient characterisation, and the absence of zero divisors.

- Apartness: Real.Interval.Apartness, ApartnessInvertible.
  #ℝ is the disjoint union of the two strict orders; the module
  proves IsApartnessRelation (symmetry, cotransitivity, irrelevance
  w.r.t. ≈ℝ) and the standard constructor lemma invertible⇒#.

- Infimum: Real.Interval.Infimum.
  Greatest lower bounds for located subsets, mirroring the supremum
  construction of v0.2.2 by reflecting through negation. The two
  together give unconditional sup- and inf-completeness for located
  subsets.

- Algebraic structure bundles: Real.Interval.Bundles.
  All previously scattered algebraic, order-theoretic, and
  completeness lemmas are now packaged into stdlib-recognised
  structures and bundles:
    IsMagma / IsSemigroup / IsMonoid / IsGroup / IsAbelianGroup
    IsRing / IsCommutativeRing
    IsHeytingCommutativeRing / IsHeytingField
    IsStrictPartialOrder / IsApartnessRelation
    CommutativeRing / Ring / AbelianGroup / CommutativeMonoid
    RawRing / RawSemiring
    HeytingCommutativeRing / HeytingField
  plus project-specific records IsIntervalOrderedField,
  IsIntervalCompleteOrderedField, and IsIntervalArchimedeanField.

- Monotone convergence: Real.Interval.MonotoneConvergence.
  Bridges order completeness and Cauchy completeness by constructing
  the supremum of a monotone sequence and identifying it with the
  Cauchy limit.

v0.2.2 — Order Completeness

Choose a tag to compare

@Ontarch Ontarch released this 26 Oct 06:54

Cauchy completeness, order completeness, weak completeness, and
bidirectional representation equivalence are all in place.

Highlights

  • Order completeness (supremum existence) via bisection:
    Real.Interval.OrderComplete, OrderComplete.Base, OrderComplete.Bisect.
  • Weak (full-metric) completeness:
    Real.Interval.WeakComplete, WeakCompleteFromCauchyI.
  • Bidirectional representation equivalence between nested-interval
    reals and Cauchy reals: Real.Interval.Retract, RetractCauchy.
  • Full reciprocal construction on the Cauchy side:
    Real.Interval.Recip, Real.Interval.Inverse.
  • Modulus regularization: Real.Regular.

v0.2.1 — Constructive Reals + Rational Physics Layer

Choose a tag to compare

@Ontarch Ontarch released this 17 Oct 15:48

This release expands ALMA from its M-type foundation into constructive
analysis and concrete physical models over ℚ.

Highlights

Constructive Reals (Base/Real/, 22 modules)

  • RealI as nested interval sequences, with dual representation
    (Cauchy sequences ↔ nested intervals).
  • Ordered-field arithmetic (+ - * /), absolute value, boundedness.
  • Cauchy completeness.
  • Multiplicative inverse up to ≈ℝ (*ℝ-inverse-pos).
  • Strictly --safe, --cubical-compatible; no postulates, no classical
    axioms.
  • The RealI core avoids dependent transport; surrounding proofs use
    only local subst for endpoint rewriting.

Rational Physics (Physics/)

  • Newtonian mechanics: quadratic Poisson algebra, Jacobi identities,
    harmonic oscillators.
  • Quantum mechanics: Gaussian rational amplitudes, unitary
    transforms, Born probability.
  • Causal sets & GR skeleton: discrete Einstein–Hilbert action,
    Benincasa–Dowker integer-valued cores, combinatorial causal orders.

Documentation

  • Base/Real/ is the top-level constructive analysis core.
  • Physics/ instantiates the meta-theory over ℚ.
  • Entry points:
    • ALMA.Base.Real.Interval
    • ALMA.Base.Real.Interval.Inverse
    • ALMA.Physics.Newtonian
  • Fully integrated into Everything.agda; passes --double-check.

Notes

  • Additive expansion; no breaking changes to the v0.2.0 M-type
    architecture.
  • Build entry: src/Everything.agda.
  • Requires Agda 2.8.0, stdlib 2.4, agda-categories 0.3.0.
  • No quotient types; reals are interval sequences throughout.

v0.2.0 — Carried M Main Line

Choose a tag to compare

@Ontarch Ontarch released this 06 Oct 16:57

Release: carried M-type architecture + Equivalence lattice

This release restructures the entire source tree around the carried
edge-family-indexed M-type architecture, and introduces the
Equivalence/ degeneration lattice as the new foundation of Base/.
The legacy strict-tower development is archived, and the active main
line is now fully zero-subst.

Highlights

New foundation: edge-family-indexed coinductive M-types.
The core of ALMA is now the carried M construction: children are
indexed directly by an edge family, with no next function and no
next-comm equation. This eliminates the subst/J transport debt that
pervaded the legacy tower.

New degeneration lattice under Base/Equivalence/.
All equivalence relations — ScaleInvariant, DiscreteEq, and their
specialisations to group actions, linear dynamics, topological and
manifold equivalences — are instances of a single indexed coinductive
skeleton Mi, organised into a two-axis lattice (keep/drop layer ×
keep/drop next). The aggregator Base/Equivalence.agda re-exports 13
new sub-modules: Core, SubstTransport, Properties,
LayeredEqGenDepth, Map, ScaleInvariant, DiscreteEq, GroupInvariant,
LinearDynamics, TopologicalEq, ManifoldEq, Lattice, StrongEquiv.
This grounds the paper's three features of the stable world-structure
(distinguishability, continuous variation, transformation invariance).

Zero-subst finite-tower colimit.
Cosmos/Carried/ reconstructs the finite-tower colimit — existence,
mediating triangle, and uniqueness up to bisimulation — with zero
subst/cast, together with machine-checked negative boundaries
(injective-but-not-surjective embeddings, forward edge-following push
simulations).

Legacy tree archived as SecondPass/.
All legacy Cosmos/ modules (CumulativeHierarchy, FinCatN,
FinCatInfinity, StrictLift, MorphismObject, DependentEmbedding, etc.)
have been moved to SecondPass/ and are frozen for archival reference.
They are no longer imported by Cosmos/.

Documentation

README rewritten:
Five source sub-trees: Base, Cosmos, SecondPass, InitialPass,
Prototype.
Cosmos/ described as the carried M main line.
Base/ traced to the SecondPass/ uniqueness stall, and to the
discovery that all equivalence relations share a single indexed
coinductive skeleton Mi.
Introduction now grounded in edge-family-indexed coinductive
M-types rather than containers.

Notes

This is a breaking change for downstream imports:
Modules formerly under ALMA.Cosmos now live under ALMA.SecondPass.
New modules appear under ALMA.Base.Equivalence.
The build entry point remains src/Everything.agda.
No changes to external dependencies (Agda 2.8.0, stdlib 2.4,
agda-categories 0.3.0).

Full commit history: see the main branch log.

v0.1.6 — Parameterised FinCat n Tower, Projective Obstruction, and the Third Path

Choose a tag to compare

@Ontarch Ontarch released this 21 Sep 09:54

New Features

FinCatNWitness: parameterised witness over FinCat n (n = suc (suc m)),
generalising FinCat2Witness; fsuc-fzero≠fzero has the opposite
orientation to the deleted zero≠suc-fzero

FinCatNTowerLemmas: parameterised structural lemmas
(shape-singleton-at, nTower-retract, nTower-collapsible)

FinCatNColimit / FinCatNColimitWithDep / FinCatNSurjectivity /
FinCatNDefaultUnif / FinCatNFunctorial / FinCatNEmbeddingMismatch /
FinCatNInnerSewing: parameterised over FinCat n

FinCatNProjectiveObstruction: generic skeleton shared by outer-rule and
inner-rule; layer-0 collapse implies no injective liftAt at layer 0

FinCatNOuterObstruction / FinCatNInnerObstruction: two diagnostic
instances of the generic obstruction

FinCatNPermutedEmbedding: a third path. For every permutation f of
Fin n with a left inverse, constructs a tower-specific embedding and a
matching liftAt; when f has a non-fixed point, it refutes the extended
criterion C (feasibility does not imply preservation of input F₀)

Key Results

Parameterisation: all FinCat 2 results generalise to FinCat n with
n = suc (suc m), so n ≥ 2 holds definitionally

Boundary: for Indiscrete (Fin n), the base category is empty at n = 0,
terminal at n = 1, and non-terminal at n ≥ 2; the obstruction appears
exactly at n ≥ 2

Third path exists: permutation-based embeddings satisfy liftAt-step,
liftAt-resp, and injectivity of liftAt 0, while failing PreservesF₀At

EmbeddingRule interface is too narrow: permuted-embed depends on
tower-specific data (embed-obj, canonicalShape, liftF) and cannot be
lifted to an EmbeddingRule; a wider interface is required for a
complete framework

The permutation group of Fin n already exists at n = 2 and supplies
the third path without additional structure

Architecture

Renamed FinCat2* to FinCatN* with parameter m : ℕ (n = suc (suc m))

Removed FinCat2Witness; added FinCatNWitness

Added FinCatNProjectiveObstruction as shared skeleton; added
FinCatNInnerObstruction and FinCatNPermutedEmbedding

Updated README and Everything.agda

v0.1.5 — Unconditional FinCat 2 Tower: Embedding Mismatch, Dependent Embedding, and Surjectivity

Choose a tag to compare

@Ontarch Ontarch released this 19 Sep 11:42

New Features

FinCat2Colimit: dependent F₀/F₁, dep-embed, colimitLayer with layer∞ = TwoObjLayer, LimitCompatible, dep-liftAt with resp/step lemmas, and the conditional WithSurjectivity framework

FinCat2EmbeddingMismatch: outer-rule ≠ dep-embed at every tower layer; embed-eq is unsatisfiable for R = outer-rule

DependentEmbedding: type class DependentEmbeddingRule; embed-eq becomes definitional (refl) after registering dep-embed-general

FinCat2ColimitWithDep: tower-level CoconeDep / UniversalLimitDep specialised to dep-embed-tower, eliminating the embed-eq side condition

FinCat2Surjectivity: unconditional SurjectivityForTower for arbitrary uniform embedding families

FinCat2DefaultUnif: default-unif from twoTower-retract and twoTower-collapsible; unconditional universal limit and non-triviality witness

Key Results

Diagnostic: outer-rule is not pointwise equal to dep-embed at any layer; embed-eq is unsatisfiable for R = outer-rule

Elimination of the embed-eq side condition via type-class internalisation

Unconditional surjectivity of dep-embed-tower on the FinCat 2 tower

Unconditional assembly: dependentUniversalLimit-default and dependentNontrivial-default

Architecture

Closes the conditional framework opened in v0.1.4; embed-eq, unif, and surj are all discharged

Renamed files and cleaned up 14 modules; updated README and Everything.agda

v0.1.4 — Cumulative Hierarchy Limits, Direction Dichotomy, and Nontriviality Conditions

Choose a tag to compare

@Ontarch Ontarch released this 16 Sep 07:45

New Features

  • CumulativeHierarchyInner: inner-preserving embedding direction
  • CumulativeHierarchyLimit: indexed tower, iterEmbed, LiftedLimitStructure, unit limit
  • CumulativeHierarchySewing: UnitSewing, FinCatSewing obstruction, DirectionDichotomy
  • FinCatInnerSewing: inner-rule, iterated inner embedding on FinCat 2
  • FinCat2Witness / FinCat2TowerLemmas: two-object witness, shape inhabitation/singletons, object bijection with Fin 2
  • LayerZeroMediator: dependent embedding, layer-0 cocone/mediator
  • ConditionalNontrivialLimit: universal limit UP, nontriviality conditions
  • StrictLiftShape: singleton/distinct shape preservation strictStep-suc

Key Results

  • Direction dichotomy: outer-rule propagates EmbeddingData iff every shape type is a singleton
  • Unit tower stitches successfully because UnitCat's shape type is ⊤, not due to a different direction
  • Conditional non-triviality: no non-trivial limit over a trivial target; coherent UniversalLimit yields a witness
  • LayerZeroMediator provides an unconditional layer-0 mediator and non-triviality witness

Architecture

  • Renamed ContFunctorStrongEquiv to Equivalence; refactored 19 modules
  • Updated README and Everything.agda

v0.1.3 — Categorical Equivalence, Automorphism Group, and Cumulative Hierarchy

Choose a tag to compare

@Ontarch Ontarch released this 11 Sep 08:12

New Features

  • ContFunctorStrongEquiv: CategoryEquivalence → StrongEquivalence for
    ContCat ≃ PolyFunctors; adjoint equivalence via C≅D.
  • ContainerAutomorphism: PosAut as a Group; injective group homomorphism
    aut→⇒ℱ into _⇒ℱ_ endomorphisms.
  • CumulativeHierarchy (+Instances): Cₙ₊₁ = ShapeCat Cₙ FCₙ; four-level
    embedding family; LambekConsistency; UnitCat / FinCat instances;
    experimental StrictLift.

v0.1.2 — Non-trivial Cosmos Instance and Morphism Correspondence

Choose a tag to compare

@Ontarch Ontarch released this 04 Sep 02:50

New Features

  • ListCosmos: first non-trivial Cosmos based on list container (ℕ, Fin)
  • MorphismCorrespondence: relation between structured simulation ⇒ℱ and CoalgHom
  • Closure: mapℱ closure properties; uniqueness of UnitCosmos

Key Results

  • Construct non-standard ⇒ℱ (onPos = swap01), showing ⇒ℱ is finer than CoalgHom
  • Concrete counterexample otherSF proves StructuredFunc ⊋ CoalgHom
  • Unconditional non-fullness of forget functor for ListCosmos

Architecture

  • Confirmed ⇒ℱ carries essential information beyond CoalgHom
  • ListCosmos provides concrete testbed for closure and iteration properties

v0.1.1 – Terminal coalgebra proof for Cosmos

Choose a tag to compare

@Ontarch Ontarch released this 02 Sep 09:38

Added:

  • Proof that Cosmos is the terminal coalgebra of CosmosF (ALMA.Cosmos.Terminal)
  • Bisimulation relation ≈C and uniqueness of anamorphism up to ≈C