Join the Lemma Waiting List

We'll notify you as spots open up.

← Back to overview
SCHEDULE

Booth Demo Schedule

We're at MPI's booth 502

Tuesday, March 17th

2pm–2:30pm

Meet Ax-Measure, Axiomatic AI's testing solution for photonic integrated circuits

Wednesday, March 18th

11am–11:30am

Meet Ax-Measure, Axiomatic AI's testing solution for photonic integrated circuits

AXIOMATIC ANYTIME

Watch

Can't make our live demos? Learn more about Axiomatic AI here.

Formalization with Lemma

Try

We've open-sourced AxProverBase, an automated theorem proving agent that is one of the core components of Lemma.

AxProverBase can be run locally, via MCP server, or as a GitHub integration.

ax-prover

$ ax-agent prove Topology/Basic.lean:compact_of_finite

Prebuilding Lean4 repo...

Proposing proof (iteration 1)

Running Lean compiler...

✗ Build failed: type mismatch, expected IsCompact

Proposing proof (iteration 2)

Refining with compiler feedback...

Running Lean compiler...

Build successful

Review: APPROVED ✓

✓ Proven (2 iterations, 14.2s)

 

theorem compact_of_finite

[TopologicalSpace α] [Finite α]

[DiscreteTopology α] :

IsCompact (Set.univ : Set α) :=

Set.Finite.isCompact (Set.toFinite _)